Enter the test case file name: graph.txt

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 1

Graph:
------
0 has edges to : 1 
1 has edges to : 1 2 3 
2 has edges to : 
3 has edges to : 3 

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 2

Give tail of edge: 1
Give head of edge: 2
Edge 1->2 exists.

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 2

Give tail of edge: 2
Give head of edge: 1
Edge 2->1 does not exist.

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 3

Nodes in self loops are: 1 3 

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 4

Inverse of graph:
-----------------
0 has edges to : 
1 has edges to : 0 1 
2 has edges to : 1 
3 has edges to : 1 3 

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 5

Give number of nodes in path: 3
Give node 0 of path: 0
Give node 1 of path: 1
Give node 2 of path: 3
This path exists and the total weight of its edges is 4

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 5

Give number of nodes in path: 2
Give node 0 of path: 3
Give node 1 of path: 2
This path does not exist in the graph.

1)Print graph
2)Check if edge exists
3)Return self loops
4)Print inverse of graph
5)Check if path exists and return weight
6)Exit
Choice: 6
Thanks for playing!