Programming language : Python

1. Execute a program to input a graph G = (V, E) as an adjacency matrix. Include functions to (i) test if G is complete (ii) obtain a path and a simple path from vertex u to vertex v. (iii) obtain the degree of a node u, if G is undirected, and indegree and outdegree of node u if G is directed