#include "iostream"
#include "map"
#include "set"
#include "list"
#include <stdlib.h>
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) |
map< int , int > getDistances_out | ( | const Graph & | graph, | |
int | init_st | |||
) | [inline] |
Definition at line 148 of file GraphAlgorithms.h.
References Graph::getStates().
map< int , typename Graph::edge_type > getGeodesicTree_in | ( | const Graph & | graph, | |
int | init_st | |||
) | [inline] |
Definition at line 28 of file GraphAlgorithms.h.
References Graph::getStates().
map< int , typename Graph::edge_type > getGeodesicTree_out | ( | const Graph & | graph, | |
int | init_st | |||
) | [inline] |
Definition at line 88 of file GraphAlgorithms.h.
References Graph::getStates().
list< edge_type > readoffGeodesicTree | ( | const map< int, edge_type > & | tree, | |
int | st_num | |||
) | [inline] |
Function finds a path in the tree starting from the state st_num to the root.
Definition at line 206 of file GraphAlgorithms.h.
int trace | ( | const LabelledGraph & | LG, | |
int | init, | |||
ConstIterator | B, | |||
ConstIterator | E | |||
) | [inline] |
Definition at line 233 of file GraphAlgorithms.h.
pair< bool , list< typename LabelledGraph::edge_type > > trace_path | ( | const LabelledGraph & | LG, | |
int | init, | |||
ConstIterator | B, | |||
ConstIterator | E | |||
) | [inline] |
Definition at line 272 of file GraphAlgorithms.h.