+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Draw a simple, connected, weighted graph with 8 vertices and 16 edges, each with unique edge…

1. Draw a simple, connected, weighted graph with 8 vertices and 16 edges, each with unique edge…

1. Draw a simple, connected, weighted graph with 8 vertices and 16 edges, each with unique edge weights. Identify one vertex as a “start” vertex and illustrate a running of Dijkstra’s algorithm on this graph.2. Show how to modify the pseudocode for Dijkstra’s algorithm for the case when the graph is directed and we want to compute shortest directed paths from the source vertex to all the other vertices.