Some early work getting started with implementing a Graph API. The graph is implemented as an adjacency list, consisting of the components:
flow_network
flow_node
flow_edge
flow_network is the main array with each flow_node as an indexed element. Each flow_node has a "bag" (a.k.a. array) of adjacency edges. Each element of the flow_node array is a pointer to a single flow_edge object.
Files have full documentation.
Some unit sets are also in the middle of development at this stage.
Some early work getting started with implementing a Graph API. The graph is implemented as an adjacency list, consisting of the components: flow_network flow_node flow_edge
flow_network is the main array with each flow_node as an indexed element. Each flow_node has a "bag" (a.k.a. array) of adjacency edges. Each element of the flow_node array is a pointer to a single flow_edge object.
Files have full documentation.
Some unit sets are also in the middle of development at this stage.