Data Structures & Algorithms Interview Questions You'll Most Likely Be Asked by Vibrant Publishers

Author:Vibrant Publishers [Publishers, Vibrant]
Language: eng
Format: epub
Publisher: Vibrant Publishers
Published: 2011-01-23T22:00:00+00:00

148: Enumerate some algorithms designed to solve the shortest path problem.

Answer:

There are several algorithms designed to minimize the shortest path cost

a) Dijkstra's algorithm - solves the single-pair, single-source, and single-destination shortest path problems

b) Bellman-Ford algorithm - solves the single source problem if edge weights may be negative

c) A* search algorithm - solves for single pair shortest path using heuristics to try to speed up the search

d) Floyd- Warshall algorithm - solves all pairs shortest paths

e) Johnson's algorithm - solves all pairs shortest paths, and may be faster than Floyd- Warshall on sparse graphs

f) Perturbation theory - finds (at worst) the locally shortest path

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.