Main Page | Modules | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members | Related Pages
hugin_base/hugin_math/graph.h File Reference
#include <vector>#include <set>#include <queue>#include <hugin_utils/stl_utils.h>Include dependency graph for graph.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
| namespace | hugin_utils |
Classes | |
| struct | hugin_utils::GraphEdge |
| struct | hugin_utils::RemoveVisitor |
| removes vertices from the set More... | |
| struct | hugin_utils::TrackVisitor |
| remember/track all visited vertices More... | |
Typedefs | |
| typedef std::vector< int > | AdjList |
| typedef std::vector< AdjList > | AdjListGraph |
Functions | |
| void | findSubGraphs (AdjListGraph &graph, std::vector< int > &subgraphStart) |
| find subgraphs | |
| template<class FUNCTOR> | |
| void | traverseEdges (const AdjListGraph &graph, int startNode, FUNCTOR &visitor) |
| traverse a graph, and run visitor on every vertice - vertice edge encounterd | |
| template<class FUNCTOR> | |
| void | traverseVertices (const AdjListGraph &graph, int start, FUNCTOR &visitor) |
| traverse graph vertices | |
Typedef Documentation
|
|
|
|
|
|
Function Documentation
|
||||||||||||
|
find subgraphs Actually, we could just use the BOOST graph library instead of hacking our own graph functions. |
|
||||||||||||||||||||
|
traverse a graph, and run visitor on every vertice - vertice edge encounterd
|
|
||||||||||||||||||||
|
traverse graph vertices
|
