Resumo

MURRAY-LASSO, M.A.. Diseño de un programa en Logo para calcular flujos máximos en redes. Ing. invest. y tecnol. [online]. 2006, vol.7, n.1, pp.45-55. ISSN 2594-0732.

The details of the design of a Logo program to calculate maximum flows between pairs of points in oriented networks with branches having upper limits to flow. For the design Lists, which are the only data strustures supported by Logo, buy which are quite appropriate to represent and handle networks not densely connected, the most common case in flow networks are utilised. Since Logo does not support arrays and they are convenient in the program, it is shown to implement them taking advantage of the flexibility of Logo in the handling of the names of variables. Listings of Logo Writer programs implementing the labelling algorithms of Ford and Fulkerson are provided. As teaching aids, routines that can be used as instruments to allow teachers and students to follow the variations in the structures during the process, are also provided. Two ilustrative examples are solved in detail.

Palavras-chave : Logo; maximum flows; labelling algorithms; lists; arrays.