Question: Using Kruskal's algorithm, Find-Union, topological sort, Dijkstra's shortest path, or Prims MST. Please explain the algorithm you would use. Pseudocode is fine, does not have

Using Kruskal's algorithm, Find-Union, topological sort, Dijkstra's shortest path, or Prims MST. Please explain the algorithm you would use. Pseudocode is fine, does not have to be actual code.
Let's say a graph G's circumference is the number of edges in the shortest cycle in G. Describe an efficient algorithm to find the circumference of a graph in O(V x E)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
