Method BellmanFord

contents/algorithm/code/BellmanFordTest.java:28–32

(int N)

    private int[] D;

    public BellmanFord(int N) {
        this.N = N;
        edges = new ArrayList<>();
        D = new int[N+1];
    }

    public void addEdge(int from, int to, int weight) {
        edges.add(new Edge(from, to, weight));