表示网络流的数据结构

Question

What would be the correct data structure to represent this network flow? Can anyone also explain the chosen data structure?

Click here to see the network flow

Answer 1

You likely want a labeled, directed graph. It might look something like this

object node
    neighbors : list<pair<node, int>>
    label : int

The neighbors would be represented by a node, as well as the number that is placed on the edge in between them. Every node would also have a label itself. The entire structure would then be the collection of all nodes.