Package prefuse.visual

Examples of prefuse.visual.NodeItem

120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
    }

    private Point2D getPoint(NodeItem n, boolean start) {
        // find the visible ancestor
        NodeItem p = (NodeItem)n.getParent();
        if ( start )
            for (; p!=null && !p.isStartVisible(); p=(NodeItem)p.getParent());
        else
            for (; p!=null && !p.isEndVisible(); p=(NodeItem)p.getParent());
        if ( p == null ) {
            m_point.setLocation(n.getX(), n.getY());
            return m_point;
        }
       
        // get the vanishing/appearing point
        double x = start ? p.getStartX() : p.getEndX();
        double y = start ? p.getStartY() : p.getEndY();
        Rectangle2D b = p.getBounds();
        switch ( m_orientation ) {
        case Constants.ORIENT_LEFT_RIGHT:
            m_point.setLocation(x+b.getWidth(), y);
            break;
        case Constants.ORIENT_RIGHT_LEFT:
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
    /**
     * @see prefuse.action.Action#run(double)
     */
    public void run(double frac) {
        // setup
        NodeItem root = getLayoutRoot();
        Rectangle2D b = getLayoutBounds();
        m_r.setRect(b.getX(), b.getY(), b.getWidth()-1, b.getHeight()-1);
       
        // process size values
        computeAreas(root);
       
        // layout root node
        setX(root, null, 0);
        setY(root, null, 0);       
        root.setBounds(0, 0, m_r.getWidth(), m_r.getHeight());

        // layout the tree
        updateArea(root, m_r);
        layout(root, m_r);
    }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
        nodes.addColumns(AREA_SCHEMA);
       
        // reset all sizes to zero
        Iterator iter = new TreeNodeIterator(root);
        while ( iter.hasNext() ) {
            NodeItem n = (NodeItem)iter.next();
            n.setDouble(AREA, 0);
        }
       
        // set raw sizes, compute leaf count
        iter = new TreeNodeIterator(root, false);
        while ( iter.hasNext() ) {
            NodeItem n = (NodeItem)iter.next();
            double area = 0;
            if ( n.getChildCount() == 0 ) {
              area = n.getSize();
              ++leafCount;
            } else if ( n.isExpanded() ) {
              NodeItem c = (NodeItem)n.getFirstChild();
              for (; c!=null; c = (NodeItem)c.getNextSibling()) {
                area += c.getDouble(AREA);
                ++leafCount;
              }
            }
            n.setDouble(AREA, area);
           
        }
       
        // scale sizes by display area factor
        Rectangle2D b = getLayoutBounds();
        double area = (b.getWidth()-1)*(b.getHeight()-1);
        double scale = area/root.getDouble(AREA);
        iter = new TreeNodeIterator(root);
        while ( iter.hasNext() ) {
            NodeItem n = (NodeItem)iter.next();
            n.setDouble(AREA, n.getDouble(AREA)*scale);
        }
    }
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
203
        m_kids.clear(); // clear m_kids
       
        // recurse
        childIter = p.children();
        while ( childIter.hasNext() ) {
            NodeItem c = (NodeItem)childIter.next();
            if ( c.getChildCount() > 0 && c.getDouble(AREA) > 0 ) {
                updateArea(c,r);
                layout(c, r);
            }
        }
    }
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
233
        double t = A/s;
       
        // re-normalize children areas
        childIter = n.children();
        while ( childIter.hasNext() ) {
            NodeItem c = (NodeItem)childIter.next();
            c.setDouble(AREA, c.getDouble(AREA)*t);
        }
       
        // set bounding rectangle and return
        r.setRect(b.getX()+m_frame,       b.getY()+m_frame,
                  b.getWidth()-2*m_frame, b.getHeight()-2*m_frame);
 
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
300
        boolean horiz = (w == r.getWidth());
       
        // set node positions and dimensions
        rowIter = row.iterator();
        while ( rowIter.hasNext() ) {
            NodeItem n = (NodeItem)rowIter.next();
            NodeItem p = (NodeItem)n.getParent();
            if ( horiz ) {
                setX(n, p, x+d);
                setY(n, p, y);
            } else {
                setX(n, p, x);
View Full Code Here
360
361
362
363
364
365
366
367
368
369
370
371
372
373
        }
        if ( m_edgeGroup != null ) {
            iter = m_vis.visibleItems(m_edgeGroup);
            while ( iter.hasNext() ) {
                EdgeItem  e  = (EdgeItem)iter.next();
                NodeItem  n1 = e.getSourceItem();
                ForceItem f1 = (ForceItem)n1.get(FORCEITEM);
                NodeItem  n2 = e.getTargetItem();
                ForceItem f2 = (ForceItem)n2.get(FORCEITEM);
                float coeff = getSpringCoefficient(e);
                float slen = getSpringLength(e);
                fsim.addSpring(f1, f2, (coeff>=0?coeff:-1.f), (slen>=0?slen:-1.f));
            }
        }
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
       
        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
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
        updateDepths(depth, n);
       
        boolean expanded = n.isExpanded();
        if ( n.getChildCount() == 0 || !expanded ) // is leaf
        {
            NodeItem l = (NodeItem)n.getPreviousSibling();
            if ( l == null ) {
                np.prelim = 0;
            } else {
                np.prelim = getParams(l).prelim + spacing(l,n,true);
            }
        }
        else if ( expanded )
        {
            NodeItem leftMost = (NodeItem)n.getFirstChild();
            NodeItem rightMost = (NodeItem)n.getLastChild();
            NodeItem defaultAncestor = leftMost;
            NodeItem c = leftMost;
            for ( int i=0; c != null; ++i, c = (NodeItem)c.getNextSibling() )
            {
                firstWalk(c, i, depth+1);
                defaultAncestor = apportion(c, defaultAncestor);
            }
           
            executeShifts(n);
           
            double midpoint = 0.5 *
                (getParams(leftMost).prelim + getParams(rightMost).prelim);
           
            NodeItem left = (NodeItem)n.getPreviousSibling();
            if ( left != null ) {
                np.prelim = getParams(left).prelim + spacing(left, n, true);
                np.mod = np.prelim - midpoint;
            } else {
                np.prelim = midpoint;
View Full Code Here
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
            }
        }
    }
   
    private NodeItem apportion(NodeItem v, NodeItem a) {       
        NodeItem w = (NodeItem)v.getPreviousSibling();
        if ( w != null ) {
            NodeItem vip, vim, vop, vom;
            double   sip, sim, sop, som;
           
            vip = vop = v;
            vim = w;
            vom = (NodeItem)vip.getParent().getFirstChild();
           
            sip = getParams(vip).mod;
            sop = getParams(vop).mod;
            sim = getParams(vim).mod;
            som = getParams(vom).mod;
           
            NodeItem nr = nextRight(vim);
            NodeItem nl = nextLeft(vip);
            while ( nr != null && nl != null ) {
                vim = nr;
                vip = nl;
                vom = nextLeft(vom);
                vop = nextRight(vop);
View Full Code Here
TOP

Related Classes of prefuse.visual.NodeItem

  • org.qi4j.envisage.graph.StackedGraphDisplay
  • org.qi4j.envisage.graph.StackedGraphDisplay$BorderColorAction
  • org.qi4j.envisage.graph.StackedGraphDisplay$FillColorAction
  • org.qi4j.envisage.graph.StackedLayout
  • prefuse.action.filter.FisheyeTreeFilter
  • prefuse.action.layout.CollapsedSubtreeLayout
  • prefuse.action.layout.graph.BalloonTreeLayout
  • prefuse.action.layout.graph.ForceDirectedLayout
  • prefuse.action.layout.graph.FruchtermanReingoldLayout
  • prefuse.action.layout.graph.NodeLinkTreeLayout
    • 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.