Algorithms Implementation

A simple and visualized method to track and understand the following algorithms.

• BFS
• DFS
• Topologic Sort
• Kosaraju-Sharir
• Kruskal
• Prim
• Dijkstra
• Bellman-Ford
• Floyd-Warshall
• DAG Shortest Path

Installation

Required Python version: 3.11 and above

Use pip to install the required libraries used to run the code.

Install commands for libraries:

pip install -r requirements.txt

OR

pip install networkx

pip install matplotlib

pip install tabulate

Usage

Running an Algorithm

Run the script and a GUI window will open on what algorithm you wish to run, select one from the list and press 'Next':

A GUI window with fields will open depending on the algorithm you chose:

• Load Graph: Load a graph from a file.
• Random/Draw: Choose if to get a random graph or if you wish to draw one.
• Save Graph: Choose if you wish to save the graph for the next run/s.
• More fields will show depending on other choices made.

When selecting 'Draw' a drawing page will open when selecting 'Submit'

• Left-Click: Create a new Node
• Right-Click: Right-click on a node and then on another node to make an edge between the nodes.
• Save Graph: Close the draw GUI to save the graph and continue the run.

Using Debugger

Run the code using a debugger if you wish to track the algorithms.

Graph Examples with Sources

Graphs are saved in the "Graphs" directory

• BFSVideoExample
• DFSVideoExample
• FloydWarshallVideoExample
• PrimVideoExample
• KruskalVideoExample
• DijkstraVideoExample
• BellmanFordVideoExample
• FordFulkersonVideoExample (Can also be run by Edmonds-Karp)