%A Stojkovikj, Natasha
%A Kocaleva, Mirjana
%A Stojanova, Aleksandra
%A Janeva, Isidora
%A Zlatanovska, Biljana
%D 2019
%T VISUALIZATION OF FORD-FULKERSON ALGORITHM
%K
%X 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.
%U http://js.ugd.edu.mk/index.php/bjami/article/view/3050
%J Balkan Journal of Applied Mathematics and Informatics
%0 Journal Article
%P 07-20
%V 2
%N 2
%8 2019-12-14