Function complex_graph

crates/compile/src/condense.rs:213–245

()

  #[test]
  fn complex_graph() {
    let a = n("A");
    let b = n("B");
    let c = n("C");
    let d = n("D");
    let e = n("E");
    let f = n("F");
    let g = n("G");
    let h = n("H");

    let graph = map_of(&[
      (&a, slice::from_ref(&b)),
      (&b, &[c.clone(), e.clone(), f.clone()]),
      (&c, &[d.clone(), g.clone()]),
      (&d, &[c.clone(), h.clone()]),
      (&e, &[a.clone(), f.clone()]),
      (&f, slice::from_ref(&g)),
      (&g, slice::from_ref(&f)),
      (&h, &[d.clone(), g.clone()]),
    ]);

    let sccs = compute_sccs(&graph);
    let mut res = vec![
      vec![n("A"), n("B"), n("E")],
      vec![n("C"), n("D"), n("H")],
      vec![n("F"), n("G")],
    ];
    for scc in &mut res {
      scc.sort();
    }
    res.sort();
    assert_eq!(scc_to_vec(&sccs), res,);
  }
}