Laserfiche WebLink
<br />node_link_pair <br /> <br />Construction of in- <br />memory graph <br /> <br />Where: <br /> <br />. node id: <br /> <br />. type: <br /> <br />vi sited: Flag indicating this node has been processed during a network traversal--currently unused. <br /> <br />current call: Current Dver call at thJS node. <br /> <br />. previous_call: Previous river call at this node, used during set call listing of relaxed/curtailed rights. <br /> <br />. connected_ups tream: Linked list of node_link_pairs connecting node to upstream nodes. <br /> <br />. connected_downstream: Linked list of node_link_pairs connecting node to downstream node. <br /> <br />. is confluence: Flag indicating node has more than one upstream node. <br /> <br />. description: <br /> <br />Ioea t ion: Position (in UTM coordinates) of this node. <br /> <br />. next: Pointer to next node in linked list of all nodes. <br /> <br />The node structure defies the end of reach and the possible locations for modeled entities (stream gauges, conflu- <br />ence, diversion, etc.). This structure contains identification information, a processing flag (visited) for recog- <br />nizing processing of the stream network, call information, pointers in which to connect the network <br />(connected_upstream and connected_downstream) as well as a pointer (next) to link off nodes <br />records together. <br /> <br />Finally, a pointer (description) which pints to a linked list of entities modeled at this point (either <br />structure_records or strearngage_cell) is placed into a unioned structure of type <br />node_typE_description. <br /> <br />typedef struct node_link_pair_rec <br />struct node_rec_struct *nodei <br />reach *linki <br />struct node_link_pair_rec *nexti <br />node_link_pair; <br /> <br />Where: <br /> <br />. node: Pointer to node being connected to. <br /> <br />. 1 ink: Pointer to reach being linking the node. <br /> <br />. next: Pointer to next node_l ink_pair on the linked list. <br /> <br />The node_l ink_pair structure is designed to link a node to a reach. Nodes have upstream and downstream <br />lists of node_1ink-pairs which connect the network. A list is needed to encode confluences. <br /> <br />The in-memory graph relies on the concept of upstream and downstream to define its relationships. The source of <br />this information is the Arcllnfo stream network coverage, which defines each arc (a reach within the in-memory <br />graph) as having a from-node and a to-node. The arcs of the stream network coverage are uniformly oriented so <br />that all to-nodes point in the upstream direction. When SPWRMS reads the Arcllnfo coverage, the from. node for <br />an arc is assumed to be the downstream node for the reach. <br /> <br />8 <br />