Software Diagram Editor
 | org.heigit.ors.routing.algorithms | Edit this Diagram
no source
class IntObjectMap
no source
class GHIntObjectHashMap
no source
class Dijkstra
Interfaceno source
interface EdgeFilter
no source
class FlagEncoder
no source
class TraversalMode
no source
class Weighting
no source
class Graph
no source
class NodeAccess
no source
class SPTEntry
no source
class EdgeExplorer
no source
class Logger
Abstract
abstract class AbstractManyToManyRoutingAlgorithm
Abstract
abstract class AbstractOneToManyRoutingAlgorithm
class DijkstraCostCondition
class DijkstraOneToManyAlgorithm
Interface
interface ManyToManyRoutingAlgorithm
Interface
interface OneToManyRoutingAlgorithm
class RPHASTAlgorithm
class SubGraph
class DownwardSearchEdgeFilter
class UpwardSearchEdgeFilter
class MultiTreeSPEntry
This class is used to create t he shortest-path-tree from li nked entities.
class MultiTreeSPEntryItem
additionalEdgeFilterflagEncodergraphinEdgeExplorernodeAccesstraversalModeweightingadditionalEdgeFilterflagEncodergraphinEdgeExplorernodeAccesstraversalModeweightingcurrEdgefromMapbestWeightMapFromcurrFromdownwardEdgeFiltermsptItemtargetGraphupwardEdgeFilterbaseGraphloggernode2EdgesMap