Examples of uk.ac.man.cs.mig.util.graph.graph.Edge

Package uk.ac.man.cs.mig.util.graph.graph

Examples of uk.ac.man.cs.mig.util.graph.graph.Edge

uk.ac.man.cs.mig.util.graph.graph.Edge
User: matthewhorridge
The Univeristy Of Manchester
Medical Informatics Group
Date: Dec 27, 2003

matthew.horridge@cs.man.ac.uk
www.cs.man.ac.uk/~horridgm

The interface for Edges contained in a Graph. An Edge represents a 2D path that connects two Nodes, that has the option to have a label. @see Graph @see Edge


    graph.add(n3);


    assertTrue(graph.getNodeCount() == 2);


    Edge e1, e2;


    e1 = new DefaultEdge(n1, n2, "Edge1", 2);


    e2 = new DefaultEdge(n2, n3, "Edge2", 2);

View Full Code Here

      // Remove the node
      nodes.remove(node);


      Iterator it = getEdgeIterator();


      Edge edge;


      // Remove any edges that are connected to the node.
      while(it.hasNext())
      {
        edge = (Edge)it.next();


      //  System.out.println("TRACE(DefaultGraph: remove) Egde: " + edge);


      //  System.out.println("\t\tTRACE(DefaultGraph: remove) TailNode: " + edge.getTailNode());


      //  System.out.println("\t\tTRACE(DefaultGraph: remove) HeadNode: " + edge.getHeadNode());


      //  System.out.println("\t\tTRACE(DefaultGraph: remove) Node: " + node);




        if(node.equals(edge.getTailNode()))
        {
          it.remove();
        }
        else if(node.equals(edge.getHeadNode()))
        {
          it.remove();
        }
      }
    }

View Full Code Here

      {
        return true;
      }
      else
      {
        Edge edge = (Edge)obj;


        if(edge.getTailNode().equals(tailNode) && edge.getHeadNode().equals(headNode))
        {
          return true;
        }
        else
        {

View Full Code Here




        int dir = DefaultGraphGenerator.this.controller.getGraphModel().getRelationshipDirection(parentNode.getUserObject(),
                                                                      childNode.getUserObject());


        Edge edge = DefaultGraphGenerator.this.edgeFactory.createEdge(parentNode, childNode, dir);


        graph.add(edge);


        fireGraphChangedEvent();


      }


      public void parentObjectRemoved(VisualisedObjectManagerEvent evt)
      {
        Node tailNode, headNode;


        tailNode = (Node)nodeMap.get(evt.getObjects().get(1));


        headNode = (Node)nodeMap.get(evt.getObjects().get(0));


        graph.remove(tailNode, headNode);


        fireGraphChangedEvent();
      }


      public void childObjectAdded(VisualisedObjectManagerEvent evt)
      {
        Node parentNode, childNode;


        parentNode = (Node)nodeMap.get(evt.getObjects().get(0));


        childNode = (Node)nodeMap.get(evt.getObjects().get(1));


        int dir = DefaultGraphGenerator.this.controller.getGraphModel().getRelationshipDirection(parentNode.getUserObject(),
                                                                              childNode.getUserObject());






        Edge edge = DefaultGraphGenerator.this.edgeFactory.createEdge(parentNode, childNode, dir);


        graph.add(edge);


        fireGraphChangedEvent();
      }

View Full Code Here


    Object par;


    Node node, parNode;


    Edge edge;


    GraphModel model = visualisedObjectManager.getGraphModel();


    parIt = model.getParents(obj);

View Full Code Here


    Object child;


    Node node, childNode;


    Edge edge;


    GraphModel model = visualisedObjectManager.getGraphModel();


    childIt = model.getChildren(obj);

View Full Code Here

{
  public void testEquals()
  {
    Node n1, n2, n3, n4;


    Edge e1, e2, e3;


    Rectangle r1, r2;


    n1 = new DefaultNode(r1 = new Rectangle(2, 3, 4, 5));


    n2 = new DefaultNode(r2 = new Rectangle(4, 5, 6, 7));


    n3 = new DefaultNode(r1);


    assertTrue(n1.equals(n3));


    e1 = new DefaultEdge(n1, n2, null, 2);


    e2 = new DefaultEdge(n3, n2, null, 2);


    e3 = new DefaultEdge(n2, n1, null, 2);


    assertTrue(e1.equals(e2));


    assertTrue(e1.equals(e3) == false);
  }

View Full Code Here

   */
  public void setEdgeAttribute(String tailNodeID, String headNodeID, String name, String value)
  {
    NodeEdgeKey nek = new NodeEdgeKey(tailNodeID, headNodeID);


    Edge edge = (Edge) edgeMap.get(nek);


    if(edge != null)
    {
      if(name.equals("pos"))
      {
        setEdgePath(edge, value);
      }
      else if(name.equals("lp"))
      {
        Point lp = new Point();


        lp = parsePoint(value);


        edge.setLabelPosition(lp.x, graphHeight - lp.y);
      }
    }


  }

View Full Code Here

TOP

Related Classes of uk.ac.man.cs.mig.util.graph.graph.Edge

uk.ac.man.cs.mig.util.graph.controller.impl.DefaultGraphGenerator

uk.ac.man.cs.mig.util.graph.graph.impl.DefaultEdge

uk.ac.man.cs.mig.util.graph.graph.impl.DefaultGraph

uk.ac.man.cs.mig.util.graph.layout.dotlayoutengine.dotparser.DotParameterSetter

uk.ac.man.cs.mig.util.graph.test.DefaultEdgeTestCase

uk.ac.man.cs.mig.util.graph.test.DefaultGraphTestCase

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.