摘要：Some definition A word u is a prefix of a word w is there exists a word v (possibly empty) such that $w=uv$ A word v is a suffix of a word w is there 阅读全文

摘要：Overview There are two different ways to achieve this algorithm. Prim From a single node s , and we can devide the whole graph into two separate parts 阅读全文

摘要：Feature There are two different situation: one is that the graph has negative weight edges, the other is not. Always remember that only in the situati 阅读全文

摘要：Feature DP is an algorithm that is very flexible. OJ Practise POJ 2392 阅读全文

摘要：Overview These two are two important search algorithm to deal with Graph Theory . In detail, because of the feature of these two algorithm, BFS is oft 阅读全文