Question

steps for dystra algorithm in points pls frnds help me​

Answer 1

Answer:

Dijkstra's algorithm example

-Convert problem to its graph equivalent.

-Assign cost to vertices.

-Calculate minimum cost for neighbors of selected source.

-Select next vertex with smallest cost from the unvisited list.

-Repeat step 4 for all the remaining unvisited nodes.

-Note.

Explanation:

hope this helps you !!