bellman ford

import java.util.Random;
import java.util.Scanner;

public class Menu {

    public static void main(String[] args) {
        int nodesource = 0;
        System.out.println("Type how many nodes you want");
        Scanner s = new Scanner(System.in);
        Random rand = new Random();
        int nodesize = s.nextInt();
      int[] nodes = createNodes(nodesize);
      int[] finalnode = new int[nodesize];
      System.out.println("|-----------------------------------------------------------------------------------------------------|");
      System.out.println("You start at 0 meters from the source node. ");
      for(int i = nodesize-1; i >= 0 ; i--){
      finalnode[i] = rand.nextInt(12+1);
      System.out.println(nodes[i] + " meters to reach the node " + (i+1) + " and " + finalnode[i] + " meters to reach the source node");
      }
      System.out.println("|-----------------------------------------------------------------------------------------------------|");
      System.out.println(" ");
         System.out.println("The shortest route is... ");
      int shortest[] = shortestRoute(nodesize,nodes,finalnode);
      System.out.println("Route " + shortest[1] + " which is " + shortest[0] + " meters from the source node.");


    }

    public static int[] shortestRoute(int nodesize, int nodes[], int finalnode[]){
        int[] route = new int[2];
        route[0] = 1000;

        for (int i = nodesize-1; i >=0 ; i--){

        if(nodes[i] + finalnode[i] < route[0]){
            route[1] = i + 1;
            route[0] = nodes[i] + finalnode[i];

         }
        }
        return route;
    }


    public static int[] createNodes(int nodesize){
    int[] nodes = new int[nodesize];
    Random rand = new Random();

    for (int i = nodesize-1; i >=0 ; i--){
    nodes[i] = rand.nextInt(16+1);
    }

    return nodes;
    }

}