1) Find the minimum spanning tree of the following graph by applying Kruskal's Algorithm of the graph. (First create the graph and then draw the lines on the graph) 2) Find the shortest path from node/vertex 1 to other nodes by using Dijkstra Algorithm. Upload your answers as a Pictures by showing your steps for Kruskal and Dijkstra Algorithms. 0 1 0 0 4 1 4 0 2 0 5 0 0 7 NENENN 3 4 5 0 6 0 7 0 8 0 8 0 0 0 0 2 0 5 0 11 6 0 0 0 0 Adjacency Matrix 3 0 0 11 0 9 10 0 0 0 4 7 8 6 9 0 0 0 0 0 5 0 0 0 10 0 0 7 0 13 6 0 0 0 0 7 0 0 0 0 0 0 7 0 0 5 5 0 0 4 8 0 0 0 0 0 13 0 4 0
1) Find the minimum spanning tree of the following graph by applying Kruskal's Algorithm of the graph. (First create the graph and then draw the lines on the graph) 2) Find the shortest path from node/vertex 1 to other nodes by using Dijkstra Algorithm. Upload your answers as a Pictures by showing your steps for Kruskal and Dijkstra Algorithms. 0 1 0 0 4 1 4 0 2 0 5 0 0 7 NENENN 3 4 5 0 6 0 7 0 8 0 8 0 0 0 0 2 0 5 0 11 6 0 0 0 0 Adjacency Matrix 3 0 0 11 0 9 10 0 0 0 4 7 8 6 9 0 0 0 0 0 5 0 0 0 10 0 0 7 0 13 6 0 0 0 0 7 0 0 0 0 0 0 7 0 0 5 5 0 0 4 8 0 0 0 0 0 13 0 4 0
Related questions
Question
Transcribed Image Text:1) Find the minimum spanning tree of the following graph by applying Kruskal's Algorithm of the graph. (First create the graph and then draw the lines on the graph)
2) Find the shortest path from node/vertex 1 to other nodes by using Dijkstra Algorithm.
Upload your answers as a Pictures by showing your steps for Kruskal and Dijkstra Algorithms.
0
1
2
3
4
5
6
7
8
0
0
4
0
0
7
0
0
0
0
1
4
0
5
0
8
0
0
0
0
2
0
5
0
11
6
0
0
0
0
Adjacency Matrix
3
0
0
11
0
9
10
0
0
0
4
7
8
6
9
0
0
0
0
0
5
0
0
0
10
0
0
7
0
13
6
0
0
0
0
0
7
0
5
0
7
0
0
0
0
0
0
5
0
4
8
0
0
0
0
0
13
0
4
0
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 7 images
