Bellman-Ford Algorithm in Java

Use the the bellman - ford algorithm and implement it in java. It should show the cost matrix, and then the distance matrix for each iteration. It stops when the last matrix has no infinity values.

package bellmanford;

import java.util.List;
import java.util.ArrayList;
import java.util.Collections;

class Vertex implements Comparable<Vertex>
{
public final String name;
public Edge[] adjacencies;
public double minDistance;
public Vertex previous;
public Vertex(String argName) { name = argName; }
public String toString() { return name; }
public int compareTo(Vertex other)
{
return Double.compare(minDistance, other.minDistance);
}
}

class Edge
{
public final Vertex target;
public final double weight;
public Edge(Vertex argTarget, double argWeight)
{ target = argTarget; weight = argWeight; }
}

public class BellmanFord
{...

This is only a preview of the solution. Please use the purchase button to see the entire solution