starting with the same graph program as last assignment implement a depth first traversal method

1. Start with node 1 as the start node.

Question

Starting with the same graph program as the last assignment, implement a depth-first traversal method. Test it on nodes 1, 2, and 3 as start nodes. Here is a pseudocode description: //============================================================================= // Pseudocode for Depth First Traversal // void dfs(Node n) { if n is visited, return // return immediately on a visited node print visiting n mark n as visited for each outgoing edge call dfs(node edge goes to) print leaving n } void dfs(Node n) { print visiting n mark n as visited for each outgoing edge if node edge goes to is not visited // avoid calling dfs on a visited node call dfs(node edge goes to) print leaving n } 2 1 3 4 6 5 7 8 9

          Starting with the same graph program as the last assignment, implement a depth-first traversal method. Test it on nodes 1, 2, and 3 as start nodes.

Here is a pseudocode description:
//=============================================================================
// Pseudocode for Depth First Traversal
//
void dfs(Node *n)
{
    if n is visited, return // return immediately on a visited node
    print visiting n
    mark n as visited
    for each outgoing edge
        call dfs(node edge goes to)
    print leaving n
}
void dfs(Node *n)
{
    print visiting n
    mark n as visited
    for each outgoing edge
        if node edge goes to is not visited // avoid calling dfs on a visited node
            call dfs(node edge goes to)
    print leaving n
}
2
1
3
4
6
5
7
8
9

starting with the same graph program as last assignment implement a depth first traversal method test iy on nodes 1 2 and 3 as start nodes here is a pseudo code description pseudo code for d 73326

Added by David S.

Question

Please give Ace some feedback