/* 
 * 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 dijkstra;

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.ExecutePaths(source, destination);
    }

}

@@ -708,15 +708,15 @@
 age 
-dijkstr
+com.nas
 a;%0D%0A

Update TestDijkstraPaths.java