Depth-First and BFS traversal

test.py

## Our graph has been converted into a dictionary in the form of {vertex: [edge1, edge2, edge3, ..., edge n]} ##

### BFS Traversal ###

first_element = list(test_graph.graph_dict.keys())[0]
last_element = list(test_graph.graph_dict.keys())[-1]
lst = list(test_graph.graph_dict[first_element].edges.keys())

for i in range(len(lst)):
    first_edge = lst[0]
    if i == 0:
        pass 
    else:
        dictionary[first_element].pop(0)
        lst.pop(0)
    output = bfs(dictionary, first_element, last_element)

    
#########################

### DFS Traversal ###

first_element = list(test_graph.graph_dict.keys())[0]
lst = list(test_graph.graph_dict[first_element].edges.keys())

for i in range(len(lst)):
    first_edge = lst[0]
    if i == 0:
        pass
    else:
        dictionary[first_element].pop(0)
        lst.pop(0)
    
    output = dfs(dictionary, first_element)
    print()
    
#########################