MUQ  0.4.3
NodeNameFinder.cpp
Go to the documentation of this file.
1 #include "MUQ/Modeling/NodeNameFinder.h"
2 
3 using namespace muq::Modeling;
4 
5 NodeNameFinder::NodeNameFinder(std::string const& name, Graph const& graph) : name(name), graph(graph) {}
6 
7 bool NodeNameFinder::operator()(boost::graph_traits<Graph>::vertex_descriptor vertex) const {
8  // check the names
9  return name.compare(graph[vertex]->name)==0;
10 }
muq::Modeling::Graph
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, std::shared_ptr< WorkGraphNode >, std::shared_ptr< WorkGraphEdge > > Graph
Define a directed graph type.
Definition: NodeNameFinder.h:13
muq::Modeling::NodeNameFinder::graph
Graph const & graph
This graph stores the vertices.
Definition: NodeNameFinder.h:36
muq::Modeling::NodeNameFinder::NodeNameFinder
NodeNameFinder(std::string const &name, Graph const &graph)
Definition: NodeNameFinder.cpp:5
muq::Modeling::NodeNameFinder::name
const std::string name
We are looking for vertices with this name.
Definition: NodeNameFinder.h:33
muq::Modeling::NodeNameFinder::operator()
bool operator()(boost::graph_traits< Graph >::vertex_descriptor vertex) const
Does a given vertex have the same name as the given name.
Definition: NodeNameFinder.cpp:7