main.java~67~

拓扑排序实现排课功能 8学期任意多门课程排序

package course;

import java.io.*;

/**
 * <p>Title: </p>
 *
 * <p>Description: </p>
 *
 * <p>Copyright: Copyright (c) 2007</p>
 *
 * <p>Company: </p>
 *
 * @author not attributable
 * @version 1.0
 */
public class Main {

    Topological top = new Topological();
    static Adjacency ad = new Adjacency();


    public static void main(String[] args) throws IOException {
        Main main = new Main();
        System.out.println("请输入你所选课的数量");
        String N, N1;
        int n, n1;
        BufferedReader in = new BufferedReader(new
                                               InputStreamReader(System.in));
        N = in.readLine();
        n = Integer.parseInt(N);

        Field v[] = new Field[n];
        int a[] = new int[n + 1];
        int b[] = new int[n + 1];
        int aa[][] = new int[n + 1][n + 1];
        System.out.println("请输入你所选的课");
//        for (int i = 1; i <= n; i++) {
//            a[i] = Integer.parseInt(in.readLine());
//            b[i] = a[i];
//        }
//构造二维矩阵
        ad.makeAdjacency(n, 0, aa);
        ad.Add(1, 3, 1, aa);
        ad.Add(1, 4, 1, aa);
        ad.Add(3, 6, 1, aa);
        ad.Add(4, 6, 1, aa);
        ad.Add(2, 5, 1, aa);
        ad.Add(5, 6, 1, aa);
        ad.Output(aa);

        System.out.println(main.top.Topo(v, n, aa));
        System.out.print("拓扑序列是：");
        for (int i = 0; i <= n - 1; i++) {
            System.out.print(v[i].i);
        }

    }
}