Package prefuse.data

Examples of prefuse.data.Edge

305
306
307
308
309
310
311
312
313
314
315
316
317
318
                   Node addMe = newNodes.getGraph().getNodeFromKey(key);
                   this.getRadialGraph().getDataGraph().getNodes().addTuple(addMe);
                   Iterator edgeIt = newNodes.getGraph().edges();
                   while(edgeIt.hasNext())
                   {
                       Edge edge = (Edge)edgeIt.next();
                       if(edge.getInt("source") == addMe.getInt("DEFAULT_NODE_KEY"))
                       {
                           this.getRadialGraph().getDataGraph().addEdge(edge.getInt("source"), edge.getInt("target"));
                       }
                   }
               }
           }
       }  //end while, checked all nodes
View Full Code Here
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
           
                //==== Show the node's edges and children
                Iterator edgeIt = ((Node)v.getSourceTuple(item)).edges();
                while(edgeIt.hasNext())
                {
                    Edge edge = (Edge)edgeIt.next();
                    int row = edge.getRow();
                    v.getVisualItem(treeEdges,edge.getGraph().getEdgeTable().getTuple(row)).setVisible(true);
                    v.getVisualItem(treeNodes, (Tuple)edge.getAdjacentNode((Node)v.getSourceTuple(item))).setVisible(true);
                    //=== Set the node's visibility to "true", used when loading saved graphs
                    edge.getAdjacentNode((Node)v.getSourceTuple(item)).setString("visible", "true");
                }
               
                return getGraphDisplayPanel();
           }
View Full Code Here
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
                        child.getGraph().getNodeTable().getTuple(row).setString("visible", "false");
                        //==== Hide the node's edges
                        Iterator edgeIt = child.edges();
                        while(edgeIt.hasNext())
                        {
                            Edge edge = (Edge)edgeIt.next();
                            int edgerow = edge.getRow();
                            v.getVisualItem(treeEdges,edge.getGraph().getEdgeTable().getTuple(edgerow)).setVisible(false);
                        }
                    }
                    else if(child.get("refType").equals("CITATIONS") && whichNodes.equals("cit"))
                    {                       
                        v.getVisualItem(treeNodes, child.getGraph().getNodeTable().getTuple(row)).setVisible(false);
                        child.getGraph().getNodeTable().getTuple(row).setString("visible", "false");
                        //==== Hide the node's edges
                        Iterator edgeIt = child.edges();
                        while(edgeIt.hasNext())
                        {
                            Edge edge = (Edge)edgeIt.next();
                            int edgerow = edge.getRow();
                            v.getVisualItem(treeEdges,edge.getGraph().getEdgeTable().getTuple(edgerow)).setVisible(false);
                        }                       
                    }
                }
                else if(childEdges < 1)
                {
                    //=== If the child is connected to another node, don't do anything
                }
            } //end which, all children checked           
        }

        //==== Hide all the attached nodes and edges
        else
        {
            //==== Record all nodes as hidden, for use by the PrefuseTooltip menu
            currentGraph.getNodeTable().setString(rowNumber, "refHidden", "true");
            currentGraph.getNodeTable().setString(rowNumber, "citHidden", "true");
           
            //==== Hide the node (visual item), and record it as hidden on the graph
            item.setVisible(false);
            currentGraph.getNodeTable().setString(rowNumber, "visible", "false");
       
            //==== Hide the selected node's edges
            Iterator edgeIt = ((Node)v.getSourceTuple(item)).edges();
            while(edgeIt.hasNext())
            {
                Edge edge = (Edge)edgeIt.next();
                int row = edge.getRow();
                v.getVisualItem(treeEdges, edge).setVisible(false);
               
                //=== Find attached FOCUS nodes and set it so that they know this node has been hidden
                Node checkNode = edge.getAdjacentNode((Node)v.getSourceTuple(item));
                if(checkNode.getString("refType").equals("FOCUS"))
                {
                    if(edge.getSourceNode().getInt("DEFAULT_NODE_KEY") == checkNode.getInt("DEFAULT_NODE_KEY"))
                    {
                        checkNode.setString("refHidden", "true");
                    }
                    else if(edge.getTargetNode().getInt("DEFAULT_NODE_KEY") == checkNode.getInt("DEFAULT_NODE_KEY"))
                    {
                        checkNode.setString("citHidden", "true");
                    }
                }
            }
View Full Code Here
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
                m_vis.getSourceTuple(m_vis.getVisualItem(treeNodes, node)).setString("visible", "false");
                //== Hide all edges to the node
                Iterator edgeIt = node.edges();
                while(edgeIt.hasNext())
                {
                    Edge edge = (Edge)edgeIt.next();
                    m_vis.getVisualItem(treeEdges, edge).setVisible(false);
                }
            } //end if
               
        }
View Full Code Here
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
       
        //== Show all edges
        Iterator edgeIt = m_vis.items(treeEdges);
        while(edgeIt.hasNext())
        {
           Edge edge = (Edge)edgeIt.next();
           m_vis.getVisualItem(treeEdges, edge).setVisible(true);
        }
        m_vis.run("repaint");
                       
    }   
View Full Code Here
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
           
                //==== Show the node's edges and children
                Iterator edgeIt = ((Node)v.getSourceTuple(item)).edges();
                while(edgeIt.hasNext())
                {
                    Edge edge = (Edge)edgeIt.next();
                    int row = edge.getRow();
                    v.getVisualItem(treeEdges,edge.getGraph().getEdgeTable().getTuple(row)).setVisible(true);
                    v.getVisualItem(treeNodes, (Tuple)edge.getAdjacentNode((Node)v.getSourceTuple(item))).setVisible(true);
                    //=== Set the node's visibility to "true", used when loading saved graphs
                    edge.getAdjacentNode((Node)v.getSourceTuple(item)).setString("visible", "true");
                }
               
                return getGraphDisplayPanel();
           }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
                Node target = findNode( parent, usesDescriptor );
                if( target == null )
                {
                    continue;
                }
                Edge edge = graph.addEdge( source, target );
                edge.setBoolean( GraphDisplay.USES_EDGES, true );
            }
        }
    }
View Full Code Here
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
        String[] vals = new String[3];
       
        xml.comment("edges");
        Iterator edges = graph.edges();
        while ( edges.hasNext() ) {
            Edge e = (Edge)edges.next();
            vals[0] = String.valueOf(e.getRow());
            vals[1] = String.valueOf(e.getSourceNode().getRow());
            vals[2] = String.valueOf(e.getTargetNode().getRow());
           
            if ( es.getColumnCount() > 2 ) {
                xml.start(Tokens.EDGE, attr, vals, 3);
                for ( int i=0; i<es.getColumnCount(); ++i ) {
                    String field = es.getColumnName(i);
                    if ( field.equals(graph.getEdgeSourceField()) ||
                         field.equals(graph.getEdgeTargetField()) )
                        continue;
                   
                    xml.contentTag(Tokens.DATA, Tokens.KEY, field,
                                   e.getString(field));
                }
                xml.end();
            } else {
                xml.tag(Tokens.EDGE, attr, vals, 3);
            }
View Full Code Here
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
            if ( o instanceof Node ) {
                Node n = (Node)o;
                m_queue.visit(n, 0);
                Iterator edges = getEdges(n);
                while ( edges.hasNext() ) {
                    Edge e = (Edge)edges.next();
                    Node nn = e.getAdjacentNode(n);
                    m_queue.visit(nn, 1);
                    if ( m_queue.getDepth(e) < 0 )
                        m_queue.add(e, 1);
                }
            } else {
                Iterator tuples = (Iterator)o;
                while ( tuples.hasNext() ) {
                    // TODO: graceful error handling when non-node in set?
                    Node n = (Node)tuples.next();
                    m_queue.visit(n, 0);
                    Iterator edges = getEdges(n);
                    while ( edges.hasNext() ) {
                        Edge e = (Edge)edges.next();
                        Node nn = e.getAdjacentNode(n);
                        m_queue.visit(nn, 1);
                        if ( m_queue.getDepth(e) < 0 )
                            m_queue.add(e, 1);
                    }
                }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
                   
                    if ( d < m_depth ) {
                        int dd = d+1;
                        Iterator edges = getEdges(n);
                        while ( edges.hasNext() ) {
                            Edge e = (Edge)edges.next();
                            Node v = e.getAdjacentNode(n);
                       
                            if ( m_includeEdges && m_queue.getDepth(e) < 0 )
                                m_queue.add(e, dd);
                            if ( m_queue.getDepth(v) < 0 )
                                m_queue.add(v, dd);
                        }
                    }
                    else if ( m_includeEdges && d == m_depth )
                    {
                        Iterator edges = getEdges(n);
                        while ( edges.hasNext() ) {
                            Edge e = (Edge)edges.next();
                            Node v = e.getAdjacentNode(n);
                            int dv = m_queue.getDepth(v);
                            if ( dv > 0 && m_queue.getDepth(e) < 0 ) {
                                m_queue.add(e, Math.min(d,dv));
                            }
                        }
                    }
                    return n;
                }
            }
               
        case Constants.EDGE_TRAVERSAL:
            Edge e = (Edge)t;
            Node u = e.getSourceNode();
            Node v = e.getTargetNode();
            int du = m_queue.getDepth(u);
            int dv = m_queue.getDepth(v);

            if ( du != dv ) {
                Node n = (dv > du ? v : u);
                int  d = Math.max(du, dv);
           
                if ( d < m_depth ) {
                    int dd = d+1;
                    Iterator edges = getEdges(n);
                    while ( edges.hasNext() ) {
                        Edge ee = (Edge)edges.next();
                        if ( m_queue.getDepth(ee) >= 0 )
                            continue; // already visited
           
                        Node nn = ee.getAdjacentNode(n);
                        m_queue.visit(nn, dd);
                        m_queue.add(ee, dd);
                    }
                }
            }
View Full Code Here
TOP

Related Classes of prefuse.data.Edge

  • org.qi4j.envisage.graph.GraphBuilder
  • paperscope.MakeVisibleExecuter
  • paperscope.PaperScopeSession
  • paperscope.RadialGraph
  • prefuse.data.io.GraphMLWriter
  • prefuse.data.util.BreadthFirstIterator
  • prefuse.data.util.NeighborIterator
  • test.prefuse.data.GraphTest
  • test.prefuse.data.TreeTest
    • 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.