Example #1
0
    // Finds an Edge given both of its vertices
    public EdgeIfc findsEdge(Vertex theSource,
                             Vertex theTarGet)
    {
        //dja: performance improvement
        //for( VertexIter vertexiter = GetVertices(); vertexiter.hasNext(); )
        // {
        //	Vertex v1 = vertexiter.next( );
        //	for( EdgeIter edgeiter = v1.GetEdges(); edgeiter.hasNext(); )
        //    {
        //          EdgeIfc theEdge = edgeiter.next();
        //		Vertex v2 = theEdge.GetOtherVertex( v1 );
        //	      if ( ( v1.GetName().Equals( theSource.GetName() ) &&
        //             v2.GetName().Equals( theTarGet.GetName() ) ) ||
        //               ( v1.GetName().Equals( theTarGet.GetName() ) &&
        //               v2.GetName().Equals( theSource.GetName() ) ) )
        //          return theEdge;
        //    }
        //}
        Vertex v1 = theSource;

        for (Iterator <EdgeIfc> edgeiter = v1.GetEdges(); edgeiter.hasNext();)
        {
            EdgeIfc theEdge = edgeiter.next();
            Vertex  v2      = theEdge.GetOtherVertex(v1);
            if ((v1.GetName().Equals(theSource.GetName()) &&
                 v2.GetName().Equals(theTarGet.GetName())) ||
                (v1.GetName().Equals(theTarGet.GetName()) &&
                 v2.GetName().Equals(theSource.GetName())))
            {
                return(theEdge);
            }
        }
        return(null);
    }
Example #2
0
    // Finds an Edge given both of its vertices
    public EdgeIfc findsEdge(Vertex theSource,
                             Vertex theTarGet)
    {
        EdgeIfc theEdge;

        // dja: performance improvement
        //  for( Iterator<EdgeIfc> edgeiter = GetEdges(); edgeiter.hasNext(); )
        for (Iterator <EdgeIfc> edgeiter = theSource.GetEdges(); edgeiter.hasNext();)
        {
            theEdge = edgeiter.next();
            if ((theEdge.GetStart().GetName().Equals(theSource.GetName()) &&
                 theEdge.GetEnd().GetName().Equals(theTarGet.GetName())) ||
                (theEdge.GetStart().GetName().Equals(theTarGet.GetName()) &&
                 theEdge.GetEnd().GetName().Equals(theSource.GetName())))
            {
                return(theEdge);
            }
        }
        return(null);
    }
Example #3
0
    public virtual void display()
    {
        System.Console.Out.Write("Node " + GetName( ) + " connected to: ");

        for (Vertex <Iterator> vxiter = GetNeighbors( ); vxiter.hasNext( );)
        {
            Vertex v = vxiter.next( );
            System.Console.Out.Write(v.GetName( ) + ", ");
        }
        System.Console.Out.WriteLine( );
    }
Example #4
0
 public void display()
 {
     if (representative == null)
     {
         System.Console.Out.Write("Rep null ");
     }
     else
     {
         System.Console.Out.Write(" Rep " + representative.GetName() + " ");
     }
     original();
 }
Example #5
0
    // Finds a vertex given its name in the vertices list
    public virtual Vertex findsVertex(string theName)
    {
        Vertex theVertex = null;

        // if we are dealing with the root
        if (theName == null)
        {
            return(null);
        }

        for (Iterator <Vertex> vxiter = GetVertices( ); vxiter.hasNext( );)
        {
            theVertex = vxiter.next( );
            if (theName.Equals(theVertex.GetName( )))
            {
                return(theVertex);
            }
        }

        return(theVertex);
    }
Example #6
0
    // Finds an Edge given both of its vertices
    public  EdgeIfc findsEdge( Vertex theSource,
                    Vertex theTarGet )
       {
        EdgeIfc theEdge;

	  // dja: performance improvement
      //  for( Iterator<EdgeIfc> edgeiter = GetEdges(); edgeiter.hasNext(); )
        for( Iterator<EdgeIfc> edgeiter = theSource.GetEdges(); edgeiter.hasNext(); )
         {
            theEdge = edgeiter.next();
            if ( ( theEdge.GetStart().GetName().Equals( theSource.GetName() ) &&
                  theEdge.GetEnd().GetName().Equals( theTarGet.GetName() ) ) ||
                 ( theEdge.GetStart().GetName().Equals( theTarGet.GetName() ) &&
                  theEdge.GetEnd().GetName().Equals( theSource.GetName() ) ) )
                return theEdge;
        }
        return null;
    }
Example #7
0
   public  EdgeIfc findsEdge( Vertex theSource,
                    Vertex theTarGet )
       {
        //dja: performance improvement
//        for( Iterator<Vertex> vertexiter = GetVertices(); vertexiter.hasNext(); )
//         {
//        Vertex v1 = vertexiter.next( );
//        for( EdgeIter edgeiter = v1.GetEdges(); edgeiter.hasNext(); )
//            {
//                EdgeIfc theEdge = edgeiter.next();
//            Vertex v2 = theEdge.GetOtherVertex( v1 );
//              if ( ( v1.GetName().Equals( theSource.GetName() ) &&
//                       v2.GetName().Equals( theTarGet.GetName() ) ) ||
//                         ( v1.GetName().Equals( theTarGet.GetName() ) &&
//                     v2.GetName().Equals( theSource.GetName() ) ) )
//                    return theEdge;
//            }
//        }
        Vertex v1 = theSource;
        for( Iterator<EdgeIfc> edgeiter = v1.GetEdges(); edgeiter.hasNext(); )
            {
                EdgeIfc theEdge = edgeiter.next();
            Vertex v2 = theEdge.GetOtherVertex( v1 );
              if ( ( v1.GetName().Equals( theSource.GetName() ) &&
                       v2.GetName().Equals( theTarGet.GetName() ) ) ||
                         ( v1.GetName().Equals( theTarGet.GetName() ) &&
                     v2.GetName().Equals( theSource.GetName() ) ) )
                    return theEdge;
            }
        return null;
    }
Example #8
0
 public void display()
 {
     System.Console.Out.WriteLine(" start=" + start.GetName() + " end=" + end.GetName());
 }