数据结构：图

package graph;

import java.util.Iterator;
import java.util.Scanner;

public class Graph {
    private final int V;  //顶点数目
    private int E;  //边的数目
    private Bag<Integer>[] adj; //邻接表

    public Graph(int V) {
        this.V=V;
        adj=(Bag<Integer>[])new Bag[V];  //创建邻接表
        for (int i = 0; i < V; i++) {  //将所有邻接表初始化为空
            adj[i]=new Bag<>();
        }
    }

    public Graph(Scanner sc) {
        this(sc.nextInt());  //读取V并将图初始化
        int E=sc.nextInt();  //读取E
        for (int i = 0; i < E; i++) {
            int v=sc.nextInt();  //读取一个顶点
            int w=sc.nextInt();  //读取另一个顶点
            addEdge(v, w); //添加一条连接它们的边
        }
    }

    public int V(){
        return V;
    }

    public int E(){
        return E;
    }

    public void addEdge(int v,int w){
        adj[v].add(w);  //将w添加到v的链表中
        adj[w].add(v);  //将v添加到w的链表中
        E++;
    }

    public Iterable<Integer> adj(int v){
        return adj[v];
    }

    @Override
    public String toString() {
        String s=V+"vertices, "+E+" edges\n";
        for (int i = 0; i < V; i++) {
            s+=i+":";
            for (int w : adj(i)) {
                s+=w+" ";
            }
            s+="\n";
        }
        return s;
    }

    //一个单向链表
    static class Bag<Item> implements Iterable<Item>{
        private Node first;  //链表的首节点
        private class Node{
            Item item;
            Node next;
        }

        public void add(Item item){
            Node oldFirst=first;
            first=new Node();
            first.item=item;
            first.next=oldFirst;
        }

        @Override
        public Iterator<Item> iterator() {
            // TODO Auto-generated method stub
            return new ListIterator();
        }

        private class ListIterator implements Iterator<Item> {
            private Node current=first;

            @Override
            public boolean hasNext() {
                // TODO Auto-generated method stub
                return current!=null;
            }

            @Override
            public Item next() {
                // TODO Auto-generated method stub
                Item item=current.item;
                current=current.next;
                return item;
            }

            public void remove(){

            }

        }
    }
}

package graph;

public class Graphs {

    //计算顶点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 i = 0; i < G.V(); i++) {
            if (degree(G, i)>max) {
                max=degree(G, i);
            }
        }
        return max;
    }

    //计算所有顶点的平均度数
    public static double avgDegree(Graph G){
        return 2.0*G.E()/G.V();
    }

    //计算自环的个数
    public static int numberOfSelfLoops(Graph G){
        int count=0;
        for (int i = 0; i < G.V(); i++) {
            for (int w : G.adj(i)) {
                if (i==w) {
                    count++;
                }
            }
        }
        return count/2;  //每条边都被记过两次
    }
}