2012年9月22日
[搜藏]多重图转换简单图的算法题--待续
摘要： 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 阅读全文
posted @ 2012-09-22 20:47 Big7 阅读(700) 评论(0) 推荐(0)