List of edges() Examples

Examples of edges()

com.tinkerpop.blueprints.GraphQuery.edges()
com.tinkerpop.blueprints.VertexQuery.edges()
mapss.dif.psdf.PSDFGraph.edges()
net.tinyos.nesc.dump.xml.WiringScanForwards.edges()
nz.ac.waikato.jdsl.graph.api.InspectableGraph.edges()
@return an iterator over all edges in the graph
prefuse.data.Graph.edges()
Get an iterator over all edges in the graph. @return an iterator over Edge instances
prefuse.data.Node.edges()
Get an iterator over all incident edges, those for which this node is either the source or the target. @return an Iterator over all incident edges
ptolemy.graph.DirectedGraph.edges()
y.base.Node.edges()

Examples of prefuse.data.Node.edges()

                    if(child.get("refType").equals("REFERENCES") && whichNodes.equals("ref"))
                    {
                        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);

View Full Code Here

Examples of prefuse.data.Node.edges()

                    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);

View Full Code Here

Examples of prefuse.data.Node.edges()

        int cliqueSize = 5;
        Graph g = GraphLib.getClique(cliqueSize);
        Edge[] edges = new Edge[4];
        
        Node rem = (Node)g.nodes().next();
        Iterator it = rem.edges();
        for ( int i=0; it.hasNext(); ++i ) {
            edges[i] = (Edge)it.next();
        }
        
        assertEquals(true, g.removeNode(rem));

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.edges()


        // Build a new graph with the delays as nodes added to the previous
        // graph.
        DirectedGraph graphPlusDelaysAsNodes = (DirectedGraph) originalGraph
                .cloneAs(new DirectedGraph());
        Object[] edges = graphPlusDelaysAsNodes.edges().toArray();
        HashMap edgeProfitsMap = new HashMap();


        for (int j = 0; j < edges.length; j++) {
            Edge edge = (Edge) edges[j];
            Node source = edge.source();

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.edges()

                        .toDouble(edge)));
            }
        }


        HashMap D = new HashMap(_delayNodeList.size());
        edges = graphPlusDelaysAsNodes.edges().toArray();


        // compute the first order longest path matrix
        HashMap predecessorMap = new HashMap();


        for (Iterator delayNodes = _delayNodeList.iterator(); delayNodes

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.edges()

        DirectedGraph dependencyGraph = _dependencyGraph;


        // Note we can not use iterator here because the edges() method
        // returns an unmodifiableList. The removeEdge() method will cause
        // a concurrentModification exception.
        Object[] edges = dependencyGraph.edges().toArray();


        for (int i = 0; i < edges.length; i++) {
            Edge edge = (Edge) edges[i];


            if (edge.source().getWeight().equals(inputPort)

View Full Code Here

Examples of y.base.Node.edges()

                Edge edge = (Edge) selected;
                nodesToSelect.add(edge.source());
                nodesToSelect.add(edge.target());
            } else if (selected instanceof Node) {
                Node node = (Node) selected;
                for (EdgeCursor ec = node.edges(); ec.ok(); ec.next()) {
                    Edge edge = ec.edge();
                    if (edge.source() != node) {
                        nodesToSelect.add(edge.source());
                    } else if (edge.target() != node) {
                        nodesToSelect.add(edge.target());

View Full Code Here

0 1 2

TOP

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.