the test
1-the shortest connection problem(kruskal), Solve the problem of the shortest connection for graph Gi.
2-the shortest path problem (Dijkstra),For the graph G₂, use Dijkstra’s algorithm to find the shortest path from vertex 1 to vertex 8.
3- maximum flows problem,For the graph G₂, find the maximum flow from vertex 1 to vertex 8.
New contributor
Abdullah Nehad is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
3