write a small program that executes the following graph algorithms in any language:

1. All-Pairs Shortest Path (Floyd-Warshall). It must ask for the vertices and edges for the user to enter them. As an output, deploy the resulting matrix. This will be done only for directed graphs.

2. Kruskal or Prim algorithm whatever you want to do. It must ask for a graph and present it at the end. The minimum coating tree that results from applying the algorithm. It can be presented as if it were a list of Vertices with ordered pairs that solve the edges. Kruskal or Prim will work with non-directed graphs.

Answer rating: 100% (QA)

Solution Heres a Python program that implements both the FloydWarshall algorithm for the allpairs sh... View the full answer