6d3ee57dd5
The existing algorithm was a little too fragile and dependent on branch numbers. This new version starts at segment 1/branch 1 and follows Segment::inletSegments() in depth-first order, taking care to enqueue new branches as they're encountered instead of in numerical order. We search to the end of each branch before switching to the next branch. This ensures determinism regardless of branch numbering and input ordering. While here, switch iLBR_ to a WindowedMatrix<int> to simplify branch references in the output table. |
||
|---|---|---|
| .. | ||
| action.hpp | ||
| aquifer.hpp | ||
| connection.hpp | ||
| doubhead.hpp | ||
| group.hpp | ||
| intehead.hpp | ||
| logihead.hpp | ||
| msw.hpp | ||
| network.hpp | ||
| tabdims.hpp | ||
| well.hpp | ||