Im a CS student, learning graphs algorithms theory (DFS, BFS, Dijkstra, Strongly connected components). My question is what is the easiest practical way to work with a graph DS in cpp: Is there any easy way to create a graph and run DFS on it? like an STL adjacency list and ready-to-run DFS using this adjacency list?
thanks :)