Search:
Roadmap
Tickets
Timeline
Browse Source
Login
API
Preferences
Home
News
Download
Features
Documentation
Support
Search
Context Navigation
View Latest Revision
source:
branches
/
RoutePlanning
/
HeuristicLab.Algorithms.GraphRouting
/
3.3
Revision Log Mode:
Stop on copy
Follow copies
Show only adds and deletes
View log starting at
and back to
Show at most
revisions per page.
Show full log messages
Legend:
Added
Modified
Copied or renamed
Diff
Rev
Age
Author
Log Message
(edit)
@8429
12 years
spimming
#1894
* renamed Graph to OsmGraph * generic type in edge interface
(edit)
@8426
12 years
spimming
#1894
various error fixed
(edit)
@8423
12 years
spimming
#1894
* bidirectional version of Dijkstra algorithm * method to get …
(edit)
@8408
12 years
spimming
#1894
* restructured test program * new, faster version of AStar …
(edit)
@8362
12 years
spimming
#1894
: use dictionary to check if closed list contains node
(edit)
@8356
12 years
spimming
#1894
: error correction on AStar algorithm
(edit)
@8350
12 years
spimming
#1894
: * new implementation for priority queue * based on heap data …
(edit)
@8321
12 years
spimming
#1894
: initial version of astar algorithm
(edit)
@8314
12 years
spimming
#1894
: * error correction on Dijkstra algorithm * test program adapted …
(edit)
@8312
12 years
spimming
#1894
: worked on Dijkstra algorithm
(edit)
@8308
12 years
spimming
#1894
: * get neighbors for specific node * method to calculate weight …
(edit)
@8302
12 years
spimming
#1894
: added missing references
(add)
@8301
12 years
spimming
#1894
: * graph routing algorithm plugin initial commit * load data in …
Note:
See
TracRevisionLog
for help on using the revision log.
Download in other formats:
RSS Feed
ChangeLog