BidirectionalDijkstra< GraphType > Class Template Reference

Bidirectional Dijkstra algorithm implementation. More...

#include <bidirectionalDijkstra.h>

List of all members.

Public Member Functions
	BidirectionalDijkstra (GraphType &graph, unsigned int *timestamp)
	Constructor.
WeightType	runQuery (const typename GraphType::NodeIterator &s, const typename GraphType::NodeIterator &t)
	Runs a shortest path query between a source node s and a target node t.

---

Detailed Description

template<class GraphType>
class BidirectionalDijkstra< GraphType >

Bidirectional Dijkstra algorithm implementation.

This class supports running queries between source and target nodes by building two search trees, one starting at the source node and one ending at the target node.

Template Parameters:

GraphType

The type of the graph to run the algorithm on

Author:

Panos Michail

---

Constructor & Destructor Documentation

template<class GraphType >

BidirectionalDijkstra< GraphType >::BidirectionalDijkstra	(	GraphType &	graph,
		unsigned int *	timestamp
	)			[inline]

Constructor.

Parameters:

	graph	The graph to run the algorithm on
	timestamp	An address containing a timestamp. A timestamp must be given in order to check whether a node is visited or not

---

Member Function Documentation

template<class GraphType >

WeightType BidirectionalDijkstra< GraphType >::runQuery	(	const typename GraphType::NodeIterator &	s,
		const typename GraphType::NodeIterator &	t
	)			[inline]

Runs a shortest path query between a source node s and a target node t.

Parameters:

	s	The source node
	t	The target node

Returns:

The distance of the target node

---

The documentation for this class was generated from the following file:

• include/Algorithms/ShortestPath/bidirectionalDijkstra.h