A program to explore various operations on the graph data structure including breadth first search (BFS), depth first search (DFS), topological sorting, Dijkstra, and an optimised Bellman Ford Algorithm
Code description, functionality, and instructions to execute are all provided in the pdf file 'Graph_Ops.pdf'. Some sample test cases have also been provided at the end of the code file, commented out.
vikrams169 / graph-data-structure-operations Goto Github PK
View Code? Open in Web Editor NEWA program to explore various operations on the graph data structure including breadth first search (BFS), depth first search (DFS), topological sorting, Dijkstra, and an optimised Bellman Ford Algorithm.