Package org.eclipse.draw2d.graph

Examples of org.eclipse.draw2d.graph.Edge

98
99
100
101
102
103
104
105
  @Override
  public void contributeToGraph(CompoundDirectedGraph graph, Map<AbstractGraphicalEditPart, Object> map) {
    Node source = (Node) map.get(getSource());
    Node target = (Node) map.get(getTarget());
    Node n = (Node) map.get(this);
    graph.edges.add(new Edge(source, n));
    graph.edges.add(new Edge(n, target));
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
    for (int n = 0; n < members.size(); n++) {
      a = (EditPart) members.get(n);
      node = (Node) map.get(a);
      if (!(a instanceof StructuredActivityPart)) {
        if (prev != null) {
          Edge e = new Edge(prev, node);
          graph.edges.add(e);
        }
        prev = node;
      }
    }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
    super.activate();
    ((Transition) getModel()).addPropertyChangeListener(this);
  }

  protected void applyGraphResults(CompoundDirectedGraph graph, Map<AbstractGraphicalEditPart, Object> map) {
    Edge e = (Edge) map.get(this);
    NodeList nodes = e.vNodes;
    PolylineConnection conn = (PolylineConnection) getConnectionFigure();

    if (nodes != null && !isManualLayout()) {
      List<AbsoluteBendpoint> bends = new ArrayList<AbsoluteBendpoint>();
      for (int i = 0; i < nodes.size(); i++) {
        Node vn = nodes.getNode(i);
        int x = vn.x;
        int y = vn.y;
        if (e.isFeedback()) {
          bends.add(new AbsoluteBendpoint(x, y + vn.height));
          bends.add(new AbsoluteBendpoint(x, y));
        }
        else {
          bends.add(new AbsoluteBendpoint(x, y));
View Full Code Here
85
86
87
88
89
90
91
92
93
  protected void contributeToGraph(CompoundDirectedGraph graph, Map<AbstractGraphicalEditPart, Object> map) {
    GraphAnimation.recordInitialState(getConnectionFigure());
    Node source = (Node) map.get(getSource());
    Node target = (Node) map.get(getTarget());
    Edge e = new Edge(this, source, target);
    graph.edges.add(e);
    map.put(this, e);
  }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
    }
    for (InternalRelationship relationship : relationshipsToConsider) {
      Node source = (Node) mapping.get(relationship.getSource());
      Node dest = (Node) mapping.get(relationship.getDestination());
      if (source != null && dest != null) {
        Edge edge = new Edge(relationship, source, dest);
        graph.edges.add(edge);
      }
    }
    DirectedGraphLayout directedGraphLayout = new DirectedGraphLayout();
    directedGraphLayout.visit(graph);
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
  @SuppressWarnings("unchecked")
  public void contributeToGraph(CompoundDirectedGraph graph, Map map) {
    GraphAnimation.recordInitialState(getConnectionFigure());
    Node source = (Node) map.get(getSource());
    Node target = (Node) map.get(getTarget());
    Edge e = null;
    if (target.data != null && target.data instanceof AbstractStatePart) {
      IState startState = ((IWebflowState) ((AbstractStatePart) target.data)
          .getState().getElementParent()).getStartState();
      IIf sourceState = (IIf) ((AbstractStatePart) source.data)
          .getModel();
      IState targetState = ((AbstractStatePart) target.data).getState();
      if (startState.getId().equals(targetState.getId())) {
        e = new Edge(this, target, source);
      }
      else {
        List children = ((IWebflowState) ((AbstractStatePart) target.data)
            .getState().getElementParent()).getStates();
        int sourceIndex = children.indexOf(sourceState);
        int targetIndex = children.indexOf(targetState);
        if (targetIndex < sourceIndex) {
          e = new Edge(this, target, source);
        }
        else {
          e = new Edge(this, source, target);
        }
      }
    }
    else {
      List children = ((IWebflowState) ((AbstractStatePart) target.data)
          .getState().getElementParent()).getStates();
      int sourceIndex = children.indexOf(source);
      int targetIndex = children.indexOf(target);
      if (targetIndex < sourceIndex) {
        e = new Edge(this, target, source);
      }
      else {
        e = new Edge(this, source, target);
      }
    }

    graph.edges.add(e);
    map.put(this, e);
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
      AbstractStatePart child = (AbstractStatePart) children.get(i);

      if (child.getModel() instanceof IActionElement) {
        if (i + 1 < children.size()) {
          // insert dummy edges
          Edge e = new Edge((Node) map.get(child), (Node) map
              .get(getChildren().get(i + 1)));
          e.weight = 1;
          graph.edges.add(e);
          map.put(this.toString() + i, e);
        }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
    Node target = (Node) map.get(getTarget());
    int sourceIndex = ((ActivityPart) getSource()).getModelElement().getSortIndex();
    int targetIndex = ((ActivityPart) getTarget()).getModelElement().getSortIndex();
    Node n = (Node) map.get(this);
    if (targetIndex < sourceIndex) {
      graph.edges.add(new Edge(target, n));
      graph.edges.add(new Edge(n, source));
    }
    else {
      graph.edges.add(new Edge(source, n));
      graph.edges.add(new Edge(n, target));
    }
  }
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
  @SuppressWarnings("unchecked")
  public void contributeToGraph(CompoundDirectedGraph graph, Map map) {
    GraphAnimation.recordInitialState(getConnectionFigure());
    Node source = (Node) map.get(getSource());
    Node target = (Node) map.get(getTarget());
    Edge e = null;
    if (target.data != null && target.data instanceof AbstractStatePart) {
      IState startState = ((IWebflowState) ((AbstractStatePart) target.data)
          .getState().getElementParent()).getStartState();
      IState sourceState = ((AbstractStatePart) source.data).getState();
      IState targetState = ((AbstractStatePart) target.data).getState();
      if (startState != null
          && startState.getId().equals(targetState.getId())) {
        e = new Edge(this, target, source);
      }
      else {
        List children = ((IWebflowState) ((AbstractStatePart) target.data)
            .getState().getElementParent()).getStates();
        int sourceIndex = children.indexOf(sourceState);
        int targetIndex = children.indexOf(targetState);
        if (targetIndex < sourceIndex) {
          e = new Edge(this, target, source);
        }
        else {
          e = new Edge(this, source, target);
        }
      }
    }
    else {
      List children = ((IWebflowState) ((AbstractStatePart) target.data)
          .getState().getElementParent()).getStates();
      int sourceIndex = children.indexOf(source);
      int targetIndex = children.indexOf(target);
      if (targetIndex < sourceIndex) {
        e = new Edge(this, target, source);
      }
      else {
        e = new Edge(this, source, target);
      }
    }
    if (getTransitionModel().getActions().size() > 0) {
      // e.weight = 3;
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
    while (iter.hasNext()) {
      IIf theIf = (IIf) iter.next();
      if (theIf.getThenTransition() != null
          && theIf.getThenTransition().getToState() != null) {
        // insert dummy edges for layouting
        Edge e1 = new Edge((Node) map.get(this), getNode(theIf
            .getThenTransition().getToState(), map));

        // e1.weight = 5;
        graph.edges.add(e1);
        map.put(this.toString() + (j++), e1);
      }
      if (theIf.getElseTransition() != null
          && theIf.getElseTransition().getToState() != null) {
        Edge e2 = new Edge((Node) map.get(this), getNode(theIf
            .getElseTransition().getToState(), map));
        // e2.weight = 5;
        graph.edges.add(e2);
        map.put(this.toString() + (j++), e2);
      }

    }

    for (int i = 0; i < getChildren().size(); i++) {
      AbstractStatePart child = (AbstractStatePart) children.get(i);

      if (child.getModel() instanceof IActionElement
          || child.getModel() instanceof IExceptionHandler) {
        if (i + 1 < children.size()) {
          // insert dummy edges
          Edge e = new Edge((Node) map.get(child), (Node) map
              .get(getChildren().get(i + 1)));
          e.weight = 1;
          graph.edges.add(e);
          map.put(this.toString() + i, e);
        }
View Full Code Here
TOP

Related Classes of org.eclipse.draw2d.graph.Edge

  • eu.admire.workbench.visualeditor.features.LayoutDiagramFeature
  • org.drools.eclipse.flow.common.editor.action.VerticalAutoLayoutAction
  • org.drools.eclipse.flow.common.editor.editpart.DirectedGraphLayoutVisitor
  • org.eclipse.sapphire.ui.swt.gef.layout.DiagramGraphLayout
  • org.eclipse.sapphire.ui.swt.gef.layout.DummyEdgeCreator
  • org.eclipse.zest.layouts.algorithms.DirectedGraphLayoutAlgorithm
  • org.fusesource.ide.camel.editor.features.custom.LayoutDiagramFeature
  • org.fusesource.ide.graph.DirectedDiagramViewLayoutAlgorithm
  • org.springframework.ide.eclipse.beans.ui.graph.model.Graph
  • org.springframework.ide.eclipse.beans.ui.livegraph.views.ExtendedDirectedGraphLayoutAlgorithm
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.