incbi.h File Reference

Incremental bidirectional Dijkstra's search (pr_bgl::incbi). More...

Go to the source code of this file.

Classes
class	pr_bgl::incbi< Graph, StartPredecessorMap, StartDistanceMap, StartDistanceLookaheadMap, GoalSuccessorMap, GoalDistanceMap, GoalDistanceLookaheadMap, WeightMap, VertexIndexMap, EdgeIndexMap, CompareFunction, CombineFunction, CostInf, CostZero, IncBiVisitor, IncBiBalancer >
	This class implements incremental bidirectional Dijkstra's search for the single-pair shortest path problem. More...
struct	pr_bgl::incbi< Graph, StartPredecessorMap, StartDistanceMap, StartDistanceLookaheadMap, GoalSuccessorMap, GoalDistanceMap, GoalDistanceLookaheadMap, WeightMap, VertexIndexMap, EdgeIndexMap, CompareFunction, CombineFunction, CostInf, CostZero, IncBiVisitor, IncBiBalancer >::conn_key
class	pr_bgl::incbi_visitor_null< Graph >
struct	pr_bgl::incbi_balancer_distance< Vertex, weight_type >
	Balance expansions to the side with the shortest distance. More...
struct	pr_bgl::incbi_balancer_cardinality< Vertex, weight_type >
	Balance expansions to the side with the smallest OPEN set cardinality. More...

Detailed Description

Incremental bidirectional Dijkstra's search (pr_bgl::incbi).

Author

Chris Dellin cdell.nosp@m.in@g.nosp@m.mail..nosp@m.com

Copyright

2015 Carnegie Mellon University

License: BSD