For a simple directed graph, the number of edges would actually depend upon the graph and the direction of edges in the graph. However if I were to generalize the number of edges in the transitive closure of a graph with V vertices, what would it be.
would it be something like V^2 as each vertex can have a path to another vertex or would it be V! ???? Pls help
would it be something like V^2 as each vertex can have a path to another vertex or would it be V! ???? Pls help
