votca 2024-dev
Loading...
Searching...
No Matches
Public Member Functions | List of all members
votca::tools::GraphDistVisitor Class Reference

#include <graphdistvisitor.h>

Inheritance diagram for votca::tools::GraphDistVisitor:
Inheritance graph
[legend]
Collaboration diagram for votca::tools::GraphDistVisitor:
Collaboration graph
[legend]

Public Member Functions

 GraphDistVisitor ()=default
 
void exploreNode (std::pair< Index, GraphNode > &p_gn, Graph &g, Edge ed=DUMMY_EDGE) override
 
- Public Member Functions inherited from votca::tools::Graph_BF_Visitor
 Graph_BF_Visitor ()=default
 
bool queEmpty () const override
 
- Public Member Functions inherited from votca::tools::GraphVisitor
virtual void exploreNode (std::pair< Index, GraphNode > &vertex_and_node, Graph &graph, Edge edge=DUMMY_EDGE)
 Edge(0,0) is a dummy value.
 
 GraphVisitor ()=default
 
std::vector< IndexgetUnexploredVertex (const Edge edge) const
 Determine which vertices in the edge, if any, have not been explored.
 
virtual bool queEmpty () const
 
void setStartingVertex (Index vertex)
 
Index getStartingVertex () const
 
void initialize (Graph &graph)
 Initialize the graphvisitor the default starting point is 0.
 
virtual void exec (Graph &graph, Edge edge)
 
Edge nextEdge (Graph graph)
 
std::set< IndexgetExploredVertices () const
 Get the set of all the vertices that have been explored.
 
bool vertexExplored (const Index vertex) const
 Has the vertex been explored.
 

Additional Inherited Members

virtual void addEdges_ (const Graph &graph, Index vertex)=0
 What is done to an individual graph node as it is explored.
 
virtual Edge getEdge_ ()=0
 
- Protected Attributes inherited from votca::tools::GraphVisitor
std::set< Indexexplored_
 set containing all the vertix ids that have been explored
 
Index startingVertex_ = 0
 The vertex the visitor started on.
 

Detailed Description

Definition at line 54 of file graphdistvisitor.h.

Constructor & Destructor Documentation

◆ GraphDistVisitor()

votca::tools::GraphDistVisitor::GraphDistVisitor ( )
default

Member Function Documentation

◆ exploreNode()

void votca::tools::GraphDistVisitor::exploreNode ( std::pair< Index, GraphNode > &  p_gn,
Graph g,
Edge  ed = DUMMY_EDGE 
)
overridevirtual

Note the only manipulation to the BF visitor is the need to add a distance attribute to each of the graph nodes.

Reimplemented from votca::tools::GraphVisitor.

Definition at line 34 of file graphdistvisitor.cc.


The documentation for this class was generated from the following files: