Module omnitigs::restricted_reachability
source · Expand description
Algorithms related to restricted reachability queries, like our basic: given an edge e, return everything reachable from the tail of e without using e.
Functions
- Returns either the set of nodes and edges backwards reachable from the last edge of aZb without using aZb as a subwalk, or None, if the whole graph can be reached this way.
- Returns either the set of nodes and edges reachable from the first edge of aZb without using aZb as a subwalk, or None, if the whole graph can be reached this way.
- Returns the backwards reachable subgraph from a node without using an edge incrementally.
- Returns the reachable subgraph from a node without using an edge incrementally.
- Returns the backwards reachable subgraph from
edge
without using the head ofedge
. - Returns the forwards reachable subgraph from
edge
without using the tail ofedge
. - Returns the backwards reachable subgraph from the head of
edge
without usingedge
. - Returns the reachable subgraph from a node without using an edge.
- Returns the forwards reachable subgraph from the tail of
edge
without usingedge
. - Returns the reachable subgraph from a node without using a node.