SimplifiedGraph typedef

SimplifiedGraph = ({Set<(int, int)> edges, Set<int> removed})

Result of simplification: the surviving edges (undirected, each stored as an ordered (low, high) pair) and the set of removed degree-2 node ids.

Implementation

typedef SimplifiedGraph = ({Set<(int, int)> edges, Set<int> removed});