Mfrhtyj

1 I'm trying to understand some graph theory and set notation. Does the statement below read like this for calculating the flow in a graph? Given some fixed input value j, sum those elements in f whose index (s,j) satisfies (s,j)∈ E So loop over all the s's (j is fixed) and add the terms corresponding to those js's which satisfy (s,j)∈E. Which effectively means sum all the flows on the edges to get the flow in a network. graph-theory share | cite | improve this question edited Jan 4 at 13:28 cherry aldi a