/*
 * Copyright (C) 2017 jadovan
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package com.nasa;

import java.util.Scanner;

/**
 * Project: NASA Path in conjunction with University of Maryland University
 * College
 *
 * @author jadovan
 */
public class TestDijkstraPaths {

    public static void main(String[] args) {

        DijkstraPaths tdjk = new DijkstraPaths();

        Scanner input = new Scanner(System.in);
        System.out.println("Enter source node: ");
        String source = input.nextLine();
        System.out.println("Enter destination node: ");
        String destination = input.nextLine();

        System.out.println();
        tdjk.testExecutePath1(source, destination);
        System.out.println();
        tdjk.testExecutePath2(source, destination);
        System.out.println();
        tdjk.testExecutePath3(source, destination);
        System.out.println();
    }

}

@@ -1,12 +1,13 @@
 /*
+ 
 %0D%0A
-
  * Copyr
@@ -708,15 +708,15 @@
 age 
-com.nas
+dijkstr
 a;%0D%0A
@@ -1293,36 +1293,32 @@
 ;%0D%0A        tdjk.
-test
 ExecutePath1(sou
@@ -1316,228 +1316,29 @@
 Path
-1(source, destination);%0D%0A        System.out.println();%0D%0A        tdjk.testExecutePath2(source, destination);%0D%0A        System.out.println();%0D%0A        tdjk.testExecutePath3(source, destination);%0D%0A        System.out.println(
+s(source, destination
 );%0D%0A

Add files via upload