Expand description
return undirected edges input: bidirected adjacency list (undirected graph) output: undirected edges [(u, v)] u < v. (but not sorted vertically) (deal with no given priority between u and v, and among edges.)
return undirected edges input: bidirected adjacency list (undirected graph) output: undirected edges [(u, v)] u < v. (but not sorted vertically) (deal with no given priority between u and v, and among edges.)