2013年12月2日
Cactus tarjan强联通
摘要： Problem Description1. It is a Strongly Connected graph.2. Each edge of the graph belongs to a circle and only belongs to one circle.We call this graph as CACTUS.There is an example as the figure above. The left one is a cactus, but the right one isn’t. Because the edge (0, 1) in the right graph belo 阅读全文
posted @ 2013-12-02 16:40 persistent codeants 阅读(174) 评论(0) 推荐(0)