algorithm for DFS
Can anybody tell me the algorithm for depth first search (DFS)? I need to write the code for DFS in python. ...
depth-first-search
help in executing the code
My code: nodes = [] stack = util.Stack() child = [] currNode = problem.getStartState() stack.push(currNode) while not stack.isEmpty(): nodes = stack.pop() if problem.isGoalState(nodes): return nodes else: child = problem.getSuccessors(nodes) ...
algorithm to enumerate all possible paths
Consider the following graph: I'm trying to find a way to enumerate all possible paths from a source node to a target node. For example, from A to E, we have the following possible paths: A B C D E A B C E A C D E A C E Note that for A C D E, there are actually 2 paths, since one of the paths uses edge F3 and the other uses edge F5...
Algorithm for counting connected components of a graph in Python
Hi, I try to write a script that counts connected components of a graph and I can't get the right solution. I have a simple graph with 6 nodes (vertexes), nodes 1 and 2 are connected, and nodes 3 and 4 are connected (6 vertexes; 1-2,3-4,5,6). So the graph contains 4 connected components. I use following script to count connected componen...