International Research journal of Management Science and Technology
ISSN 2250 - 1959 (online) ISSN 2348 - 9367 (Print) New DOI : 10.32804/IRJMST
**Need Help in Content editing, Data Analysis.
Adv For Editing Content
DEVELOPMENT OF GIS TOOL FOR THE SOLUTION OF MAXIMUM FLOW NETWORK USING FORD-FULKERSON ALGORITHM
1 Author(s): SALONI JAIN
Vol - 6, Issue- 6 , Page(s) : 42 - 55 (2015 ) DOI : https://doi.org/10.32804/IRJMST
GIS and network analysis remains exponential fields which are characterized by rapid scientific progress. Network analysis is one of the notable and purposeful research and application areas regarding GIS. The problem of computing a max flow in network analysis is an elementary combinatorial problem with applications in transportation, planning and resource scheduling. Countlessmaximum flow algorithms have been designed over the past decade to improve complexity. Network analysis helps in finding favourable locations for services to be provided. In augmentation, maximum flow problem is calculated by finding a realistic flow through a single source, single sink flow network that is maximum. For this all the augmenting paths are covered linking from source to destination until all paths are covered.The maximum flow network is the simplest problem concerning flow network. This paper discusses maximum flow problem using python programming in GIS environment.