数据结构与算法II

Posted on | Edited on

图

用邻接表来表示

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
public class Graph{
	private final int V;
	private int E;
	private Bag<Integer>[] adj;
	public Graph(int V){
		this.V=V;thisE=0;
		adj=(Bag<Integer>[])new Bag[V];
		for(int v=0;v<V;v++)
			adj[v]=new Bag<Integer>();
	}
	public int V(){return V;}
	public int E(){return E;}
	
	public void addEdge(int v,int w){
        adj[v].add(w);
        adj[w].add(v);
        E++;
	}
	
	







	int v();
	int E();
    public String toString();
    public Graph(int v);
    
    public static int degree(Graph G,int v){
        int degree=0;
        for(int W:G.adj(v))degree++;
        return degree;
    }
    public static int maxDegree(Graph G){
        int max=0;
        for(int v=0;v<G.V();v++)
            if(degree(G,v)>max)
            	max=degree(G,v);
        return max;
    }
    public static int numberOfSelfLoops(Graph G){
        int count=0;
        for(int v=0;v<G.V();v++)
        	for(int w:G.adj(v))
        		if(v==w)count++;
        return count/2;
    }
    
    public String toString(){
        String 
    }
}