#include <algorithm>#include <cassert>#include "votca/tools/edge.h"#include "votca/tools/reducedgraph.h"
Include dependency graph for reducedgraph.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::compareChainWithChains_ (const vector< Index > &chain, const vector< vector< Index > > &chains) |
| Function will compare a chain with a vector of chains. | |
| set< Index > | votca::tools::getVertexJunctions_ (const vector< ReducedEdge > &reduced_edges) |
| Given a vector of Reduced Edges will find and return junctions if any exist. | |
| void | votca::tools::addEdgeIfNotLoop_ (vector< Edge > &edges, const ReducedEdge reduced_edge, unordered_map< Edge, vector< vector< Index > > > &expanded_edges) |
| function adds an edge to an unordered_map and a vector if it is found to not be a loop | |
| void | votca::tools::orderChainAfterInitialVertex_ (vector< Index > &chain) |
| This is a helper function used to help store the vertex chain in a reproducable order. | |
| bool | votca::tools::reorderAndStoreChainIfDoesNotExist_ (vector< Edge > &edges, unordered_map< Edge, vector< vector< Index > > > &expanded_edges, vector< Index > chain, Index vertex, size_t &chain_index) |
| set< Index > | votca::tools::getAllVertices_ (const std::vector< ReducedEdge > &reduced_edges) |
| set< Index > | votca::tools::getAllConnectedVertices_ (const unordered_map< Edge, vector< vector< Index > > > &expanded_edges) |
| ostream & | votca::tools::operator<< (ostream &os, const ReducedGraph graph) |
