In degree, the measure of how many directed edges are coming into a node, and out degree, the measure of how many directed edges are starting from a node, are used as comparative metrics to quantify the differences between network structure.

To measure all pairs max flow, we employ two algorithms, the Edmonds-Karp Algorithm\citep{edmonds1972theoretical} and the Push-Relabel Algorithm \citep{goldberg1985new}. The Edmonds-Karp Algorithm is defined in  \ref{601679} and runs in \(O\left(VE^2\right)\). The Push-Relabel Algorithm is defined in \ref{606334} and runs in \(O\left(V^3\right)\)