coreachable

From co- +‎ reachable.

coreachable (not comparable)

1. (graph theory) Mutually reachable, that is, for any two nodes n1 and n2, they are coreachable iff n1 is reachable from n2 and n2 is reachable from n1.
   • 2013, Marcello La Rosa, Pnina Soffer, Business Process Management Workshops: BPM 2012 International Workshops, Tallinn, Estonia, September 3, 2012, Revised Papers, page 118:

     Further, non coreachable nodes are qualified as forbidden. The loop terminates when all forbidden markings (those initially declared and those newly identified) are processed.

   • 2018, Cezar Câmpeanu, Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, page 77:

     Two cycles are coreachable if there exists a path from any of them to the other one.

• coreachability