Competitive Programming

Homework:

Implement Graph with

1. Dictionary(this is what I implemented in class)
2. List of Edges(this is the first way of represent we discussed in class, you can assume weight is always 1)

Following methods are required to be implemented:

get_edges(): return all edges

get_nodes(): return all nodes

get_connected_nodes(node1): return all nodes connected with node1

delete_edge(node1, node2): delete the node between node1 and node2