Package prefuse.data

Examples of prefuse.data.Graph

50
51
52
53
54
55
56
57
58
59
60
        return builder.buildApplicationNode( descriptor );
    }

    /* package */ GraphBuilder()
    {
        graph = new Graph( true );

        Table nodeTable = graph.getNodeTable();
        nodeTable.addColumn( GraphDisplay.NAME_LABEL, String.class );
        nodeTable.addColumn( GraphDisplay.USER_OBJECT, Object.class );

View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
   
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        initSchema(g.getNodes());
       
        Point2D anchor = getLayoutAnchor();
        NodeItem n = getLayoutRoot();
        layout(n,anchor.getX(),anchor.getY());
    }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
245
   
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        initSchema(g.getNodes());
       
        Arrays.fill(m_depths, 0);
        m_maxDepth = 0;
       
        Point2D a = getLayoutAnchor();
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
133
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        initSchema(g.getNodes());
       
        m_origin = getLayoutAnchor();
        NodeItem n = getLayoutRoot();
        Params np = (Params)n.get(PARAMS);
       
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
   
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        Rectangle2D bounds = super.getLayoutBounds();
        init(g, bounds);

        for (int curIter=0; curIter < maxIter; curIter++ ) {

            // Calculate repulsion
            for (Iterator iter = g.nodes(); iter.hasNext();) {
                NodeItem n = (NodeItem)iter.next();
                if (n.isFixed()) continue;
                calcRepulsion(g, n);
            }

            // Calculate attraction
            for (Iterator iter = g.edges(); iter.hasNext();) {
                EdgeItem e = (EdgeItem) iter.next();
                calcAttraction(e);
            }

            for (Iterator iter = g.nodes(); iter.hasNext();) {
                NodeItem n = (NodeItem)iter.next();
                if (n.isFixed()) continue;
                calcPositions(n,bounds);
            }

View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
   
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        initSchema(g.getNodes());
       
        Point2D anchor = getLayoutAnchor();
        NodeItem n = getLayoutRoot();
        layout(n,anchor.getX(),anchor.getY());
    }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
   
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        Graph g = (Graph)m_vis.getGroup(m_group);
        initSchema(g.getNodes());
       
        Arrays.fill(m_depths, 0);
        m_maxDepth = 0;
       
        Point2D a = getLayoutAnchor();
        m_ax = a.getX();
        m_ay = a.getY();
       
        NodeItem root = getLayoutRoot();
        Params rp = getParams(root);

  g.getSpanningTree(root);
       
        // do first pass - compute breadth information, collect depth info
        firstWalk(root, 0, 1);
       
        // sum up the depth info
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
     */
    private void computeAreas(NodeItem root) {
        int leafCount = 0;
       
        // ensure area data column exists
        Graph g = (Graph)m_vis.getGroup(m_group);
        TupleSet nodes = g.getNodes();
        nodes.addColumns(AREA_SCHEMA);
       
        // reset all sizes to zero
        Iterator iter = new TreeNodeIterator(root);
        while ( iter.hasNext() ) {
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
40
41
     * number of nodes
     * @param n the number of nodes
     * @return a graph with n nodes and no edges
     */
    public static Graph getNodes(int n) {
        Graph g = new Graph();
        g.getNodeTable().addColumns(LABEL_SCHEMA);
       
        for ( int i=0; i < n; i++ ) {
            Node node = g.addNode();
            node.setString(LABEL, String.valueOf(i));
        }
        return g;
    }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
     * number of satellite nodes.
     * @param n the number of points of the star
     * @return a "star" graph with n points, for a total of n+1 nodes
     */
    public static Graph getStar(int n) {
        Graph g = new Graph();
        g.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = g.addNode();
        r.setString(LABEL, "0");
       
        for ( int i=1; i <= n; ++i ) {
            Node nn = g.addNode();
            nn.setString(LABEL, String.valueOf(i));
            g.addEdge(r, nn);
        }
        return g;
    }
View Full Code Here
TOP

Related Classes of prefuse.data.Graph

  • org.cishell.testing.convertertester.core.tester.graphcomparison.GraphComparerTester
  • org.cishell.testing.convertertester.core.tester2.DefaultTestRunner
  • org.picocontainer.gems.monitors.prefuse.PrefuseDependencyGraph
  • org.qi4j.envisage.graph.GraphBuilder
  • org.qi4j.envisage.graph.GraphPane
  • org.rioproject.tools.ui.GraphView
  • org.rioproject.tools.ui.GraphView$TreeRootAction
  • paperscope.GraphAdapter
  • paperscope.PaperScopeUI
  • paperscope.RadialGraph$TreeRootAction
    • 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.