Network Flow Algorithms- a Comparison of Routes of a Delivery Boy

In the discipline of mathematics, graph theory algorithms are of great importance. The field of mathematics gives us with a wide range of algorithms that can be used in our daily lives. In this study, I employed various graph theory algorithms to perform a resemblance. The comparison's objective is to identify the best cost-effective and efficient supply route for an online business platform. A delivery route for the abovementioned goal was picked for the network problem, and several algorithms were implemented. The shortest path algorithm (Dijkstra's Algorithm), spanning tree algorithms (prim's and Kruskal's Algorithm) and Hamiltonian cycle algorithms (Brute Force Algorithm, Sorted Edges Algorithm, Nearest Neighbor Algorithm) algorithms are discussed in this study. The algorithms procedures were explained in detail using numerous examples. These algorithms are briefly discussed in this report to show how these algorithms function over my research problem. The study suggests that Hamiltonian cycle algorithms are the easiest and convenient method in finding the route to the present.