Finding Alternatives

• Consider union nodes

  • with at least 2 predecessors M, N

• Gm & Gn are alternatives when

  • M is sink node of Gm
    • N is sink node of Gn
  • All nodes is Gm are connected to M by a path in Gm
    • Same for Gn
  • Predecessors (Gm) = Predecessors(Gn)

Previous slide

Next slide

Back to first slide

View graphic version