Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
transitive closure of a digraph
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
0 · ·