Ford-Fulkerson Algorithm Instructions: Write a well-documented program which
1. reads in a network, in the form of a weighted, directed adjacency matrix .
2. provides an implementation of the Ford-Fulkerson algorithm to find a maximal flow in the network. (I will give partial credit to implementations which identify forward-flowing paths only.)
3. shows the flow paths and the capacity along each path, along with the total flow of the network