import java.util.*;

public class Dijkstra
{
    private int size;
    private int graaf[][];
    private ArrayList<Integer> gevondenPad = new ArrayList<Integer>();
   
    public Dijkstra(int[][] matrix, int x)
    {
        size = x;
        int graaf[][] = matrix;
    }
    
    public void zoek(int beginPunt, int eindPunt)
    {
        boolean nietKlaar = true;
        boolean padAanwezig = true;
        int nodeNietInS;
        int tempArray1[] = new int[size];
        int tempArray2[][] = new int[2][size];
       
        for (int i=0; i<size; i++) 
        {
            tempArray1[i] = 0;
            tempArray2[0][i] = Integer.MAX_VALUE;
            tempArray2[1][i] = -1;
        }

        tempArray1[beginPunt] = 1;
        tempArray2[0][beginPunt] = 0;
        tempArray2[1][beginPunt] = beginPunt;
        for (int i=0; i<size; i++) 
        {
            if ((beginPunt != i) && (graaf[beginPunt][i] > -1)) 
            { 
                tempArray2[0][i] = graaf[beginPunt][i];
                tempArray2[1][i] = beginPunt;
            }
        }
etc