#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 | |
Should be replaced with bgl, the graph library from BOOST
This is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
You should have received a copy of the GNU General Public License along with this software; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Definition in file graph.h.
|
|
|
|
|
|
|
||||||||||||
|
find subgraphs Actually, we could just use the BOOST graph library instead of hacking our own graph functions. Definition at line 39 of file graph.cpp. References hugin_utils::traverseVertices(). |
|
||||||||||||||||||||
|
traverse a graph, and run visitor on every vertice - vertice edge encounterd
Definition at line 81 of file graph.h. References DEBUG_DEBUG, and set_contains(). |
|
||||||||||||||||||||
|
traverse graph vertices
Definition at line 121 of file graph.h. References set_contains(). Referenced by hugin_utils::findSubGraphs(). |
1.3.9.1