Hi all,
I have a directed igraph-network that represents a river network (incl. up- and downstream direction). My nodes are points along the river network, river confluences and also barriers (e.g. weirs, dams) that are connected via the edges.
Some of the nodes, i.e. barriers have varying passability. This means a barrier can be e.g. impassable in upstream direction but passable in downstream direction. Now, I'd like to calculated shortest distances/path from one set of nodes to another set of nodes along the directed river network, however, by also considering the passability of the barrier-nodes, i.e. to consider that some barriers "break" the graph and are impassible but only when approached from a specific direction. How could this be achieve with the igraph library?
Of course I could break the entire igraph-network at each barrier into many smaller subnetworks. But then I consider that barrier-nodes are impassable in both directions, up- and downstream. So, any ideas?
All the best,
Johannes