Suppose the flows along the streets are \(f_1\text{,}\) \(f_2\text{,}\) \(f_3\text{,}\) \(f_4\text{,}\) \(f_5\text{,}\) and \(f_6\) cars per hour in the directions shown.
Then, equating the flow in with the flow out at each intersection, we get
\begin{equation*}
\begin{array}{lrl}
\mbox{Intersection } A \amp 500 \amp = f_1 + f_2 + f_3 \\
\mbox{Intersection } B \amp \quad f_1 + f_4 + f_6 \amp = 400 \\
\mbox{Intersection } C \amp f_3 + f_5 \amp = f_6 + 100 \\
\mbox{Intersection } D \amp f_2 \amp = f_4 + f_5 \\
\end{array}
\end{equation*}
These give four equations in the six variables \(f_1, f_2, \dots , f_6 \text{.}\)
\begin{equation*}
\begin{array}{rlrlrlrlrlrcr}
f_1 \amp + \amp f_2 \amp + \amp f_3 \amp \amp \amp \amp \amp \amp \amp = \amp 500 \\
f_1 \amp \amp \amp \amp \amp + \amp f_4 \amp \amp \amp + \amp f_6 \amp = \amp 400 \\
\amp \amp \amp \amp f_3 \amp \amp \amp + \amp f_5 \amp - \amp f_6 \amp = \amp 100 \\
\amp \amp f_2 \amp \amp \amp - \amp f_4 \amp - \amp f_5 \amp \amp \amp = \amp 0 \\
\end{array}
\end{equation*}
The reduction of the augmented matrix is
\begin{equation*}
\left[ \begin{array}{rrrrrr|r}
1 \amp 1 \amp 1 \amp 0 \amp 0 \amp 0 \amp 500 \\
1 \amp 0 \amp 0 \amp 1 \amp 0 \amp 1 \amp 400 \\
0 \amp 0 \amp 1 \amp 0 \amp 1 \amp -1 \amp 100 \\
0 \amp 1 \amp 0 \amp -1 \amp -1 \amp 0 \amp 0
\end{array} \right]
\rightarrow
\left[ \begin{array}{rrrrrr|r}
1 \amp 0 \amp 0 \amp 1 \amp 0 \amp 1 \amp 400 \\
0 \amp 1 \amp 0 \amp -1 \amp -1 \amp 0 \amp 0 \\
0 \amp 0 \amp 1 \amp 0 \amp 1 \amp -1 \amp 100 \\
0 \amp 0 \amp 0 \amp 0 \amp 0 \amp 0 \amp 0
\end{array} \right]
\end{equation*}
Hence, when we use \(f_4\text{,}\) \(f_5\text{,}\) and \(f_6\) as parameters, the general solution is
\begin{equation*}
f_1 = 400 - f_4 - f_6 \quad\quad f_2 = f_4 + f_5 \quad\quad f_3 = 100 - f_5 + f_6
\end{equation*}
This gives all solutions to the system of equations and hence all the possible flows.
Of course, not all these solutions may be acceptable in the real situation. For example, the flows \(f_1, f_2, \dots , f_6 \) are all positive in the present context (if one came out negative, it would mean traffic flowed in the opposite direction). This imposes constraints on the flows: \(f_1 \geq 0\) and \(f_3 \geq 0\) become
\begin{equation*}
f_4 + f_6 \leq 400 \quad\quad f_5 - f_6 \leq 100
\end{equation*}
Further constraints might be imposed by insisting on maximum values on the flow in each street.