public void Dijkstra(T departureNode) {
        this.initDijsktra(departureNode);
        int dn = getNode(departureNode);
        // Set dn as visited
        nodes.get(dn).setVisited(true);

        for (int p = 0; p < this.getSize(); p++) {
            for (int v = 0; v < this.getSize(); v++) {
                int w = v;
                if (this.D[w] != Graph.INFINITE) {
                    nodes.get(w).setVisited(true);
                    for (int i = 0; i < size; i++) {
                        if (edges[w][i] && D[w] + weight[w][i] <= D[i]) {
                            D[i] = D[w] + weight[w][i];
                            PD[i] = w;
                        }
                    }
                }

            }
        }
    }