Skip to content

Latest commit

 

History

History
53 lines (46 loc) · 1.71 KB

TODO.md

File metadata and controls

53 lines (46 loc) · 1.71 KB

Tasks Routing

Prio 1

  • SimpleGraphFactory (from csv) -> doing
  • more DijkstraAborter
    • one of several edges
    • all out of a list of several edges
    • maximum weight
  • Start from offset (GraphDecorator)
  • Edge.weight() configurable via attributes (EdgeWeigher)
    • needs Edge with attribute list
  • Locator (extract edge from graph?)
    • needs edge with location information (full edge)
  • ProhibitedPaths (graph decorator, reverse projection) -> doing

Prio 2

  • A* (Estimate)
    • needs Edge with location (start / end coordinate?)
    • needs translation between distance and minimum weight
  • double A*
  • TileGraph (graph decorator)
    • needs Edge with tile information
  • HierarchicalGraph (graph decorator)
  • OpenStreetMap-Importer
  • time-dependent routing
  • EdgeWeigher dependent on used vehicle

Further ideas

Done

  • make Dijkstra abort criteria configurable
    • full
    • one edge
  • Route instead of List
  • cleanup: dedicated workflow and two convenience methods
  • include cost determination