Diseño de un programa en logo para calcular flujos máximos en redes

Abstract

THE DETAILS OF THE DESIGN OF A LOGO PROGRAM TO CALCULATE MAXIMUM FLOWS BE TWEEN PAIRS OF POINTS IN ORIENTED NET WORKS WITH BRANCHES HAVING UPPER LIMITS TO FLOW ARE PRESENTED. FOR THE DE SIGN LISTS, WHICH ARE THE ONLY DATA STRUCTURES SUPPORTED BY LOGO, BUT WHICH ARE QUITE APPROPRIATE TO REPRESENT AND HANDLE NET WORKS NOT DENSELY CONNECTED, THE MOST COMMON CASE IN FLOW NET WORKS ARE UTILISED. SINCE LOGO DOES NOT SUPPORT ARRAYS AND THEY ARE CONVENIENT IN THE PROGRAM, IT IS SHOWN HOW TO IMPLEMENT THEM TAKING ADVANTAGE OF THE FLEXIBIL ITY OF LOGO IN THE HANDLING OF THE NAMES OF VARIABLES. LISTINGS OF LOGO WRITER PROGRAMS IMPLEMENT ING THE LABELLING AL GO RITHMS OF FORD AND FULKERSON ARE PROVIDED. AS TEACHING AIDS, ROUTINES THAT CAN BE USED AS IN ST