pub fn simplify(
graph: &impl SequentialGraph,
memory_usage: MemoryUsage,
) -> Result<Left<ArcListGraph<impl Iterator<Item = ((usize, usize), ())> + Clone + Send + Sync + 'static>>>Expand description
Returns a simplified (i.e., undirected and loopless) version of the provided graph as a sequential graph.
Note that if the graph is sorted (both on nodes and successors), it is
recommended to use simplify_sorted.
For the meaning of the additional parameter, see SortPairs.