ShortestPaths policy that minimizes the length of each path. More...

Inheritance diagram for MinLength< graph_t >:

Collaboration diagram for MinLength< graph_t >:

Public Member Functions
	MinLength (const graph_t &G)
	Computes shortest path in given graph. More...

Public Member Functions inherited from ShortestPaths< graph_t, MinLength< graph_t > >
void	print_path (std::ostream &os, node_t i) const
	Print shortest path to node i to the output stream. More...

void	compute_with_root (node_t new_root)
	Compute all paths using given root. More...

bool	disconnected (node_t) const
	Checks if node is connected to any one of the sources. More...

Friends
class	ShortestPaths< graph_t, MinLength< graph_t > >

Additional Inherited Members
Public Types inherited from ShortestPaths< graph_t, MinLength< graph_t > >
typedef graph_t::node_t	node_t
	The node type. More...

typedef graph_t::neighborhood_t::const_iterator	edge_iter_t
	The iterator type used in the paths. More...

Public Attributes inherited from ShortestPaths< graph_t, MinLength< graph_t > >
std::vector< std::vector< edge_iter_t > >	paths
	The shortest paths from the sources to all nodes. More...

std::vector< node_t >	root_per_path
	The source of each path. More...

Protected Member Functions inherited from ShortestPaths< graph_t, MinLength< graph_t > >
	ShortestPaths (const graph_t &G)
	Constructor computes the shortest paths given the graph. More...

Protected Attributes inherited from ShortestPaths< graph_t, MinLength< graph_t > >
const graph_t &	G
	Constant reference to the graph. More...

std::vector< size_t >	distance_policy
	The distance from a source to a node, computed by some policy (eg weight) More...

std::vector< std::pair< node_t, edge_iter_t > >	previous
	previous[i]=(node,edge) where node is 1 step closer to the source and edge connects node to i More...

node_t	root
	The root (source) of the graph being considered. More...

Detailed Description

ShortestPaths policy that minimizes the length of each path.

Constructor & Destructor Documentation

MinLength ( const graph_t & G )

Computes shortest path in given graph.

friend class ShortestPaths< graph_t, MinLength< graph_t > >

friend

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