摘要：131. Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome 阅读全文

摘要：G(V,E,W), E~O(V^2) for complete graphOrder of graph: VSize of graph: EComplete graph: has one edge between each pair of vertices.Simple graph: has at ... 阅读全文

摘要：public class Graph{ public void dfs(Vertex u) { u.visit(); u.visited = true; for(each v such that (u,v) belongs E) { if(!v.visited)... 阅读全文