import rpi.goldsd.container.Hashable;
import rpi.goldsd.container.IntSequence;
import rpi.goldsd.container.Str;
import rpi.goldsd.container.Sequence;
import rpi.goldsd.graph.*;

public class LongestPathTest3
{
  public static void main( String[] args )
  {
    Graph G = new Graph( "Sample Graph" );

    Vertex A = new Vertex( "A" );
    Vertex B = new Vertex( "B" );
    Vertex C = new Vertex( "C" );
    Vertex D = new Vertex( "D" );
    Vertex E = new Vertex( "E" );
    Vertex F = new Vertex( "F" );

    G.add( A );
    G.add( B );
    G.add( C );
    G.add( D );
    G.add( E );
    G.add( F );

    G.add( new Edge( A, B, 30.0 ) );
    G.add( new Edge( A, C, 40.0 ) );
    G.add( new Edge( A, D, 50.0 ) );
    G.add( new Edge( B, C, 20.0 ) );
    G.add( new Edge( B, E, 40.0 ) );
    G.add( new Edge( C, E, 60.0 ) );
    G.add( new Edge( D, F, 30.0 ) );
    G.add( new Edge( E, F, 10.0 ) );

    G.printSummary();
    Path P = Algorithms.findLongestPath( A, F );

    System.out.println();
    System.out.print( "Longest Path (simple greed): " );
    System.out.println( P );
    System.out.println( "  Weight of Path is: " + P.weight() );


    P = Algorithms.findLongestPath2( A, F, 3 );
    System.out.println();
    System.out.print( "Longest Path (stratified greed): " );
    System.out.println( P );
    System.out.println( "  Weight of Path is: " + P.weight() );
  }
}