package eliminateCodeFear.algorithms.graphs.dijsktra;

import org.junit.Before;
import org.junit.Test;

//
// Note: This is code for a future episode. Stay tuned!
//

public class ShortestPathTest {

    private ShortestPath g;

    @Before
    public void SetUp() {
        g = new ShortestPath();
    }

    @Test
    public void BreadFirstSearch() {
        int graph[][] = new int[][]{
                {0, 4, 0, 0, 0, 0, 0, 8, 0},
                {4, 0, 8, 0, 0, 0, 0, 11, 0},
                {0, 8, 0, 7, 0, 4, 0, 0, 2},
                {0, 0, 7, 0, 9, 14, 0, 0, 0},
                {0, 0, 0, 9, 0, 10, 0, 0, 0},
                {0, 0, 4, 14, 10, 0, 2, 0, 0},
                {0, 0, 0, 0, 0, 2, 0, 1, 6},
                {8, 11, 0, 0, 0, 0, 1, 0, 7},
                {0, 0, 2, 0, 0, 0, 6, 7, 0}
        };
        ShortestPath t = new ShortestPath();
        t.dijkstra(graph, 0);
    }

}
