top of page

Summary:

Finds all possible paths on a weighted directional graph and reports the paths and weights to the user.

​

Uses brute force recursion to try every possible path. On a successful path, path is stored and the program continues.

​

Uses nested linked lists to store the graph data - runs with O(n^3) efficency.

  • Hit the play button on top of the window for interactive mode

graph.jpg
The Graph

Brute Force Path Finding

Challenge:

  • Find all paths using recursion.

  • Sort the solutions by weight and output to user.

  • Allow the user to decide the start and end nodes interactively.

​

C++​

Language:

More Info:

Documentation

Full files and usage descriptions available at linked site.

Generated with Doxygen.

bottom of page