Question: Given directed graph with nodes: [0, 1, 2, 3, 4, 5] and edges: [(0, 1), (0, 4), (1, 2), (1, 4), (2, 3), (2, 5),
Given directed graph with nodes: [0, 1, 2, 3, 4, 5] and edges: [(0, 1), (0, 4), (1, 2), (1, 4), (2, 3), (2, 5), (3, 5)] perform Breadth First Search algorithm starting from vertex 0. Choose correct statements:
1.Classes of visited edges are: {(0, 1): 'T', (0, 4): 'B', (1, 2): 'T', (1, 4): 'B', (2, 3): 'B', (2, 5): 'C', (3, 5): 'B']
2.Distances of visited nodes are: {0: 0, 1: 1, 4: 1, 2: 2, 3: 3, 5: 3}
3.The order of visited nodes is [0, 5, 1, 2, 4, 3]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
