Explore BrainMass
Share

Explore BrainMass

    Dijkstra's shortest path algorithm

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Requirements:

    Implement Dijkstra's shortest path algorithm, findShortestPath.

    Suggestions:

    Write helper methods to find the next vertex or update the distance and predecessor structures.
    Write tests for your helper methods, this will help ensure your code is correct.
    Project layout

    The project has the following directory layout:

    Dijkstra/
    src/
    all program source code
    lib/
    all project library dependencies
    test/
    all test classes
    There may also be a separate directory storing your compiled classes.

    Building and testing:

    Use your IDE to build your code and run the included JUnit tests.

    © BrainMass Inc. brainmass.com October 10, 2019, 4:00 am ad1c9bdddf
    https://brainmass.com/computer-science/programming-languages/dijkstras-shortest-path-algorithm-445949

    Attachments

    Solution Summary

    Dijkstra's shortest path algorithm are examined.

    $2.19