Flow in Network
Flow in Network. Graph, oriented graph, network. A graph G =( V , E ) is specified by a non empty set of nodes V and a set of edges E such that each edge a is identified by a pair of nodes ( u , v ) . c a b d V = {1, 2, 3} E = { a, b, c, d }
746 views • 69 slides