小熊听

Tarjan 算法：（求图的联通分量）import java.util.ArrayList;import java.util.HashMap;import java.util.HashSet;import java.util.List;import java.util.Stack;public class Tarjan { Stack stack=new Stack();

求无向图的最小生成树：public class Prim { public int prim(int[][] graph,int start){ int[] dis=new int[graph.length]; int re=0; for(int i=0;i<graph.length;i++){ dis[i]=graph[start][i]; } boolean

Kruskal：import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;import java.util.List;public class Kruskal { public static List kruskal(List graph,int n){ List a

Kruskal：import java.util.ArrayList;import java.util.Collections;import java.util.Comparator;import java.util.List;public class Kruskal { public static List kruskal(List graph,int n){ List a

Floyed 算法：import java.util.Arrays;public class Floyed { public static int[][] floyed(int[][] graph){ int[][] path=new int[graph.length][graph[0].length]; for(int i=0;i<path.length;i++){

求图的欧拉回路：public class Solution { public ArrayList getEulerCircle(String cur,HashMap> map){ if(map.isEmpty()) return re; dfs(cur,map); return re; } ArrayList re=new ArrayLis