Dikjstra< graph_t, policy_t > Class Template Reference

#include <Graph.hpp>

Inheritance diagram for Dikjstra< graph_t, policy_t >:

Public Types
typedef graph_t::node_t	node_t
typedef graph_t::neighborhood_t::const_iterator	edge_iter_t

Public Member Functions
bool	operator() (node_t a, node_t b) const
void	print_path (std::ostream &os, node_t i) const
void	compute_with_root (node_t new_root)

Public Attributes
std::vector< std::vector< edge_iter_t > >	paths
std::vector< node_t >	root_per_path
std::vector< size_t >	distance_policy

Protected Member Functions
	Dikjstra (const graph_t &G)

Protected Attributes
std::vector< std::pair< node_t, edge_iter_t > >	previous
node_t	current
node_t	root
const graph_t &	G

Friends
template<typename a , typename b >
std::ostream &	operator<< (std::ostream &, const Dikjstra< a, b > &)

Member Typedef Documentation

node_t

typedef graph_t::node_t node_t

edge_iter_t

typedef graph_t::neighborhood_t::const_iterator edge_iter_t

Constructor & Destructor Documentation

Dikjstra()

Dikjstra ( const graph_t &  G )

protected

Member Function Documentation

operator()()

bool operator()	(	node_t	a,
		node_t	b
	)		const

print_path()

void print_path	(	std::ostream &	os,
		node_t	i
	)		const

compute_with_root()

void compute_with_root

(

node_t

new_root

)

Friends And Related Function Documentation

operator<<

std::ostream& operator<< ( std::ostream &  , const Dikjstra< a, b > &    )

friend

Member Data Documentation

paths

std::vector<std::vector<edge_iter_t> > paths

root_per_path

std::vector<node_t> root_per_path

distance_policy

std::vector<size_t> distance_policy

previous

std::vector<std::pair<node_t, edge_iter_t> > previous

protected

current

node_t current

protected

root

node_t root

protected

G

const graph_t& G

protected

---

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

• Graph.hpp