12 std::shared_ptr<GraphNode>
addNode();
13 std::shared_ptr<GraphNode>
getNode(
int nodeID);
15 const bool hasCycles(
const std::shared_ptr<GraphNode> startNode)
const;
19 std::list<std::shared_ptr<GraphNode>>
_nodes;
21 bool TraverseNodesUntilCycle(
const std::shared_ptr<GraphNode> node, std::vector<bool>& visited, std::vector<bool>& recursiveStack)
const;
std::list< std::shared_ptr< GraphNode > > _nodes
Definition Graph.h:19
std::shared_ptr< GraphNode > addNode()
Definition Graph.cpp:5
const bool hasCycles(const std::shared_ptr< GraphNode > startNode) const
Definition Graph.cpp:24
std::shared_ptr< GraphNode > getNode(int nodeID)
Definition Graph.cpp:12
int _counter
Definition Graph.h:18
bool TraverseNodesUntilCycle(const std::shared_ptr< GraphNode > node, std::vector< bool > &visited, std::vector< bool > &recursiveStack) const
Definition Graph.cpp:34
const std::list< std::shared_ptr< GraphNode > > getContainedNodes() const
Definition Graph.h:14