摘要：
Given an adjacency-list representation of a multigraphG = (V, E), describe an O(V + E)-time algorithm tocompute the adjacency-list representation of the"equivalent" undirected graph G' = (V, E'), where E'consists of the edges in E with all the multiple edgesbetween two vertices 阅读全文
