beadmotifalgorithms.cc File Reference

#include <cassert>
#include <cstddef>
#include <utility>
#include <votca/tools/graphalgorithm.h>
#include <votca/tools/reducedgraph.h>
#include "../../include/votca/csg/beadmotifconnector.h"
#include "votca/csg/beadmotifalgorithms.h"

Include dependency graph for beadmotifalgorithms.cc:

Go to the source code of this file.

Classes
class	votca::csg::MotifDeconstructor_
	This is an internal class meant to deconstruct bead motifs into their simple forms. More...

Namespaces
namespace	votca
	base class for all analysis tools
namespace	votca::csg
namespace	votca::tools

Typedefs
typedef std::pair< Index, BeadMotif >	votca::csg::IdMotif

Functions
void	votca::csg::removeAllEdgesConnectedToVertex_ (Index junction, Graph &full_graph, unordered_map< Edge, bool > &remove_edges)
	Determines which edges are connected to the junction and stored them in the remove_edges map.
Index	votca::csg::determineEdgesOfBranchesWithSingleConnectionToJunction_ (Index junction, ReducedGraph &reduced_graph, unordered_map< Edge, bool > &remove_edges, unordered_map< Index, vector< Edge > > contracted_branch_edges_connected_to_junction)
void	votca::csg::calculateEdgesToRemove_ (Graph &full_graph, unordered_map< Edge, bool > &remove_edges)
	Calculates which edges to remove from a graph, in order to split it up correctly into simple motif types.
std::pair< std::unordered_map< Index, BeadMotif >, BeadMotifConnector >	votca::csg::breakIntoSimpleMotifs (BeadMotif bead_motif)
	This function will take a beadmotif and break it into its simple motifs.

Variables
const Index	votca::csg::unassigned_id = -1
static Index	votca::csg::motif_index = 0