View | Details | Raw Unified | Return to bug 258752
Collapse All | Expand All

(-)src/org/eclipse/zest/layouts/algorithms/DirectedGraphLayoutAlgorithm.java (-31 / +1 lines)
Lines 10-19 Link Here
10
 *******************************************************************************/
10
 *******************************************************************************/
11
package org.eclipse.zest.layouts.algorithms;
11
package org.eclipse.zest.layouts.algorithms;
12
12
13
import java.lang.reflect.Field;
14
import java.util.HashMap;
13
import java.util.HashMap;
15
import java.util.Iterator;
14
import java.util.Iterator;
16
import java.util.List;
17
15
18
import org.eclipse.draw2d.geometry.Dimension;
16
import org.eclipse.draw2d.geometry.Dimension;
19
import org.eclipse.draw2d.graph.DirectedGraph;
17
import org.eclipse.draw2d.graph.DirectedGraph;
Lines 25-58 Link Here
25
23
26
public class DirectedGraphLayoutAlgorithm extends AbstractLayoutAlgorithm {
24
public class DirectedGraphLayoutAlgorithm extends AbstractLayoutAlgorithm {
27
25
28
	class ExtendedDirectedGraphLayout extends DirectedGraphLayout {
29
30
		public void visit(DirectedGraph graph) {
31
			Field field;
32
			try {
33
				field = DirectedGraphLayout.class.getDeclaredField("steps");
34
				field.setAccessible(true);
35
				Object object = field.get(this);
36
				List steps = (List) object;
37
				steps.remove(10);
38
				steps.remove(9);
39
				steps.remove(8);
40
				steps.remove(2);
41
				field.setAccessible(false);
42
				super.visit(graph);
43
			} catch (SecurityException e) {
44
				e.printStackTrace();
45
			} catch (NoSuchFieldException e) {
46
				e.printStackTrace();
47
			} catch (IllegalArgumentException e) {
48
				e.printStackTrace();
49
			} catch (IllegalAccessException e) {
50
				e.printStackTrace();
51
			}
52
		}
53
54
	}
55
56
	public DirectedGraphLayoutAlgorithm(int styles) {
26
	public DirectedGraphLayoutAlgorithm(int styles) {
57
		super(styles);
27
		super(styles);
58
	}
28
	}
Lines 74-80 Link Here
74
			Edge edge = new Edge(relationship, source, dest);
44
			Edge edge = new Edge(relationship, source, dest);
75
			graph.edges.add(edge);
45
			graph.edges.add(edge);
76
		}
46
		}
77
		DirectedGraphLayout directedGraphLayout = new ExtendedDirectedGraphLayout();
47
		DirectedGraphLayout directedGraphLayout = new DirectedGraphLayout();
78
		directedGraphLayout.visit(graph);
48
		directedGraphLayout.visit(graph);
79
49
80
		for (Iterator iterator = graph.nodes.iterator(); iterator.hasNext();) {
50
		for (Iterator iterator = graph.nodes.iterator(); iterator.hasNext();) {

Return to bug 258752