Inheritance diagram for votca::tools::GraphDistVisitor:

[legend]

Collaboration diagram for votca::tools::GraphDistVisitor:

[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
	GraphVisitor ()=default

std::vector< Index >	getUnexploredVertex (const Edge edge) const
	Determine which vertices in the edge, if any, have not been explored.

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< Index >	getExploredVertices () 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
Protected Attributes inherited from votca::tools::GraphVisitor
std::set< Index >	explored_
	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

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

default

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.

Definition at line 34 of file graphdistvisitor.cc.

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