Laserfiche WebLink
<br />uuu071 <br /> <br />ItrMm_MtwoR_hud _ <br /> <br />'~nod'Uecord(~ <br />node_id <br />.". <br />viued <br />(;\, cUfTef1,-call <br />\!.J prevK>us_caJI <br />cornecIed_~I"'m <br />connectsll:Cdownsl.....m.- <br />isgonllllellCS <br />~n <br />- <br />'""--- <br />~node_record(-. <br />'llxllUd <br />.". <br />vis~ed <br />O """"'-'" <br />2 prflvjouuall <br />cornecled_upstr8llm- <br />connect".Utownstream- <br />is_conlluence <br />~n <br />....., <br />'"" -----. <br />"--... <br />.......nodlt_nocon:t( <br />node_id <br />.". <br />viNed <br />t:::\ c........Cllll <br />o =::~~~m~ <br />connected_downst.....m- <br />is_conlluence <br />desa1>Cion <br />....... <br />'""---------- <br />~node_reooo::l{ <br />node_id <br />.". <br />vided <br />O """"'-'" <br />prM:>us_caI <br />4 connllded_,-""lf8llm~- <br />cornecI81Cdownslream---. <br />is_c:onlIuence <br />de~ion <br />....., <br />'""---------- <br />~... <br /> <br />Topology: <br /> <br />~8 <br /> <br />9 <br /> <br />All the nodes in the stream network are also held in a linked list of type node_record. The head to this list is <br />a global variable named s trearn_network_head. Structures in the node list are linked into the topology of <br />reaches as described below. <br /> <br />Figure 2 shows the relationship between a reach and its adjacent nodes in the simplest case. Here, each node has <br />a single upstream connection and a single downstream connection. Each upstream or downstream connection in <br />the graph consists of one node_1ink--pair, indicating a node and a reach associated with that node. Note <br />that each node has two connections, one node_link--pair identifying that node and its upstream reach, <br />another referring to the same node and its downstream reach. Also note that each reach is referred to by two <br />node_link_pairs, since it forms the upstream connection for one node and the downstream connection for <br />another. <br /> <br />~ <br /> <br />/~... <br /> <br />_~node_~nkJ>Air{ ~ <br />~ --=-----::: \!J <br />~., ~ <br />,~ ------ <br />_YfII""nodeJink..,pai<l ~ ~ <br />::t ~=- \!J <br />nexl~,- ~ <br />~ ~ <br /> <br />~rellch{ <br />"if' (display merrbsfll) <br />Ia!LlossJecord <br />..,., <br /> <br />_.. node_~nk..,pair{ ~ <br />~------- -- \V <br />_;';::.~~" ~~ 7-"" <br />---.",. node- 2 ldi8play_rrbe<sj <br />link~~ Ia!LIosa_nMXIrd <br />,nexl-:::f-~' length <br /> <br />_"node_~nkJ>U'{ <br />""" <br />,.. <br />~. <br />~ <br /> <br />.0 <br /> <br />_"'JII"node_linlu>aj,( <br />~~ ./ <br />\ -=-- ------------ <br /> <br />-"'I <br />(display members) <br />lag.j'>5S_record <br />..,.. <br /> <br />,... <br /> <br />)Io;93"oa", "0,wu'k6c~;~'~t~~~~ '~' La,o ~ 0 <br /> <br />~0 <br /> <br />~ <br /> <br />Figure 3 shows the relationship between a reach and its adjacent nodes in a more complicated case. This <br />scenario contains a confluence, so one node, number I, has two upstream connections. This is represented by <br />