A New Approach For Solving The Minimal Flow, Shortest Route, Maximal Flow And The Critical Path Using Network
Abstract
— The principle objective of this paper is to give a presentation about network, especially corresponding to the essential parts of drawing an organization graph. This paper provides a brief overview on network analysis as a statistical approach. Networks comprise graphical representation of the relationship between edges and nodes. Network technique is a project that has divided into many small activities and these activities can be used to find the Minimal flow algorithm, shortest route algorithm, Maximal flow algorithm and the Critical Path using the best methods like Kruskal’s algorithm, Dijkstra’s algorithm, Ford Fulkerson algorithm and PERT.The primary contribution of the work is to find the minimal flow, shortest route, maximal flow and the critical path using network. A numerical example is shown to highlight the procedure of the proposed method at the end of this paper.
Keywords
Minimal flow algorithm, shortest route algorithm, maximal flow algorithm and the critical path algorithm.