caiobm

/*
 *  Main.java 1.0
 *  Application to SearchGraphAlgorithms
 */

/**
 *
 * @author Caio Bomfim Martins
 */
public class Main {
    public static void main(String[] args) throws java.io.IOException {
        SearchGraphAlgorithms ga = new SearchGraphAlgorithms();

        Graph<Double,Double> mg = new MatGraph("graph.txt");

        SearchGraphAlgorithms.SearchInfo so = ga.search(TypeSearchEnum.DIJKSTRA, 4, mg);

        System.out.println("A partir do vertice 4: ");
        System.out.println("Menor Caminho para o ");
        for(int i = 0; i < 8; i++) {
            System.out.println("Vertice " + i + " " + so.getPathFrom(i));
        }

        System.out.println("\n\nMenor Distancia para o ");
        for(int i = 0; i < 8; i++) {
            System.out.println("Vertice " + i + " " + so.getDistFrom(i));
        }
    }
}