Search:
Roadmap
Tickets
Timeline
Browse Source
Login
API
Preferences
Home
News
Download
Features
Documentation
Support
Search
Context Navigation
View Latest Revision
Older Revisions
→
source:
branches
/
RoutePlanning
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)
@8516
12 years
spimming
#1894
: * solution restructured * removed obsolete and outdated parts
(edit)
@8514
12 years
spimming
#1894
: experimented with different settings in cost and heuristic function
(edit)
@8512
12 years
spimming
#1894
: tweaking of max edge speeds and heuristic cost function
(edit)
@8509
12 years
spimming
#1894
: Dijkstra: get node with a specific rank graph interface …
(edit)
@8504
12 years
spimming
#1894
: new read data method using NameTable for better performance
(edit)
@8488
12 years
spimming
#1894
: * introduced weight property in Edge * new data source …
(edit)
@8481
12 years
spimming
#1894
: * adapted AStar and Dijkstra algorithms for new graph …
(edit)
@8480
12 years
spimming
#1894
: * fixed problem with edge category in XmlDataSource * initial …
(edit)
@8479
12 years
spimming
#1894
: * temporarily added weight and heuristic function to graph * …
(edit)
@8462
12 years
spimming
#1894
: * calculate distance in kilometers for two locations * generate …
(edit)
@8461
12 years
spimming
#1894
: * Implemented interface IGraph in Graph * Equals method in …
(edit)
@8438
12 years
spimming
#1894
graph interface and implementation initial commit
(edit)
@8434
12 years
spimming
#1894
* renamed old Vertex<T> to OsmVertex<T> * added new Vertex class
(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)
@8369
12 years
spimming
#1894
* consider driving directions (one way roads) and * check if …
(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
Note:
See
TracRevisionLog
for help on using the revision log.
Download in other formats:
RSS Feed
ChangeLog