#include <list>#include "votca/tools/graph.h"#include "votca/tools/graph_bf_visitor.h"#include "votca/tools/graph_df_visitor.h"#include "votca/tools/graphalgorithm.h"#include "votca/tools/graphvisitor.h"
Include dependency graph for graphalgorithm.cc:
Go to the source code of this file.
Namespaces | |
| namespace | votca |
| base class for all analysis tools | |
| namespace | votca::tools |
Functions | |
| bool | votca::tools::singleNetwork (Graph &graph, GraphVisitor &graph_visitor) |
| Determine if every vertex is connected to every other one through some combination of edges. | |
| std::set< Edge > | votca::tools::exploreBranch (Graph g, Index starting_vertex, const Edge &edge) |
Explore one of the branches if exploration is initiated at vertex starting_vertex. | |
| ReducedGraph | votca::tools::reduceGraph (Graph graph) |
| Will take a graph and reduce it, by removing all vertices with degree of 2. | |
| std::vector< Graph > | votca::tools::decoupleIsolatedSubGraphs (Graph graph) |
| Break graph into smaller graph instances if the network is made up of isolated sub networks. | |
| void | votca::tools::exploreGraph (Graph &graph, GraphVisitor &graph_visitor) |
| Explore a graph with a graph visitor. | |
