#include "iostream"
#include "map"
#include "set"
#include "list"
Go to the source code of this file.
Functions | |
template<class Graph> | |
map< int, typename Graph::edge_type > | getGeodesicTree_in (const Graph &graph, int init_st) |
template<class Graph> | |
map< int, typename Graph::edge_type > | getGeodesicTree_out (const Graph &graph, int init_st) |
template<class Graph> | |
map< int, int > | getDistances_out (const Graph &graph, int init_st) |
template<class edge_type> | |
list< edge_type > | readoffGeodesicTree (const map< int, edge_type > &tree, int st_num) |
Function finds a path in the tree starting from the state st_num to the root. | |
template<class LabelledGraph, class ConstIterator> | |
int | trace (const LabelledGraph &LG, int init, ConstIterator B, ConstIterator E) |
template<class LabelledGraph, class ConstIterator> | |
pair< bool, list< typename LabelledGraph::edge_type > > | trace_path (const LabelledGraph &LG, int init, ConstIterator B, ConstIterator E) |
|
Definition at line 146 of file GraphAlgorithms.h. References Graph::getStates(). |
|
Definition at line 26 of file GraphAlgorithms.h. References Graph::getStates(). |
|
Definition at line 86 of file GraphAlgorithms.h. References Graph::getStates(). |
|
Function finds a path in the tree starting from the state st_num to the root.
Definition at line 204 of file GraphAlgorithms.h. |
|
Definition at line 231 of file GraphAlgorithms.h. |
|
Definition at line 270 of file GraphAlgorithms.h. |