reachable -- Returns the vertices reachable in a digraph from a given collection of vertices

Synopsis

• Usage:

  Rl = reachable(D, L)

  Rs = reachable(D, S)

• Inputs:
  • D, an instance of the type Digraph,
  • L, a list, a list of vertices
  • S, a set, a set of vertices
• Outputs:
  • Rl, a list, the list of reachable vertices
  • Rs, a set, the set of reachable vertices

Description

See also

• descendants -- returns the descendants of a digraph
• isReachable -- checks if a vertex u is reachable from a vertex v