VISUALIZATION OF FORD-FULKERSON ALGORITHM

  • Natasha Stojkovikj
  • Mirjana Kocaleva Computer Science Faculty, Goce Delcev University, Stip, Republic of Macedonia
  • Aleksandra Stojanova
  • Isidora Janeva
  • Biljana Zlatanovska

Abstract

In this paper, is examined the Ford-Fulkerson algorithm for finding the maximum flow in the flow network. For this purpose, we first give the basic definitions of the flow, the residual network and the augmenting path. Also, a program for visualizing the Ford Fulkerson algorithm has been made (in Java) in order students to understand the algorithm easier.

Published
Dec 14, 2019
How to Cite
STOJKOVIKJ, Natasha et al. VISUALIZATION OF FORD-FULKERSON ALGORITHM. Balkan Journal of Applied Mathematics and Informatics, [S.l.], v. 2, n. 2, p. 07-20, dec. 2019. Available at: <http://js.ugd.edu.mk/index.php/bjami/article/view/3050>. Date accessed: 28 jan. 2020.
Section
Articles