#include #include #include #include class Node { private: std::string name; bool visited; std::vector> link; public: Node() { name = ""; visited = false; } Node(std::string name) { this->name = name; visited = false; } std::string getName() { return this->name; } std::vector> getLink() { return link; } bool getVisited() { return visited; } void setVisited(bool v) { visited = v; } void setLink(std::vector node, std::vector edge) { for (int i = 0; i < node.size(); i++) link.push_back(std::make_pair(node[i],edge[i])); } }; class Graph { private: std::vector> graph_node; public: std::vector> getGraph() { return graph_node; } bool contains(std::string name) { for (std::pair i : graph_node) if (i.first->getName() == name) return true; return false; } void addNode(std::vector node) { for (Node* i : node) graph_node.push_back(std::make_pair(i,0)); } void destroyGraph() { for (std::pair &i : graph_node) delete i.first; graph_node.clear(); } void resetVisit() { for (std::pair &i : graph_node) i.first->setVisited(false); } bool sample_DFS(Node* source) { if (source->getVisited()) return false; source->setVisited(true); for (std::pair i : source->getLink()) { if (!i.first->getVisited()) std::cout << source->getName() << " -> " << i.first->getName() << std::endl; sample_DFS(i.first); } } }; int main() { Graph* obj = new Graph(); Node* A = new Node("A"); Node* B = new Node("B"); Node* C = new Node("C"); Node* D = new Node("D"); Node* E = new Node("E"); obj->addNode({A,B,C,D,E}); A->setLink({B,C}, {10,5}); B->setLink({C,D}, {2,1}); C->setLink({B,D,E}, {3,9,2}); D->setLink({E}, {4}); E->setLink({A,D}, {7,6}); obj->sample_DFS(A); obj->destroyGraph(); delete obj; }

Sample Graph Traversal (List version)