Aspire Faculty ID #12808 · Topic: JECA MCA 2023 · Just now
JECA MCA 2023

__________ algorithm is used to find out the shortest path between two points in a connected weighted graph.  

Solution

Kruskal’s algorithm (and Prim’s) are used in shortest path/minimum spanning tree problems.

Previous 10 Questions — JECA MCA 2023

Nearest first

Next 10 Questions — JECA MCA 2023

Ascending by ID
Ask Your Question or Put Your Review.

loading...