Examples of org.gephi.graph.api.HierarchicalGraph.addNode()

Class org.gephi.graph.api.HierarchicalGraph

Examples of org.gephi.graph.api.HierarchicalGraph.addNode()

org.gephi.graph.api.HierarchicalGraph.addNode()
Add node as a child of parent in the graph. If parent is null, node is added as a child of the (virtual) root node. Fails if the node already exists. @param node the node to add @param parent the existing node whose a child is to be added or null @return true if add is successful, false otherwise @throws IllegalArgumentException if node is null,or if parent is not legal in the graph @throws IllegalMonitorStateException if the current thread is holding a read lock


        //Nodes
        for (int i = 0; i < 5; i++) {
            Node node = factory.newNode();
            node.getNodeData().setLabel("Node " + i);
            graph.addNode(node);
        }


        for (Node n : graph.getTopNodes().toArray()) {
            Node newC = factory.newNode();
            graph.addNode(newC, n);

View Full Code Here

            graph.addNode(node);
        }


        for (Node n : graph.getTopNodes().toArray()) {
            Node newC = factory.newNode();
            graph.addNode(newC, n);
        }


        //treeStructure.showTreeAsTable();


        //Test getNodes()

View Full Code Here

            Node n = draftNode.getNode();
            NodeDraftGetter[] parents = draftNode.getParents();
            if (parents != null) {
                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }

View Full Code Here

                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }


        //Remove point from all nodes not in draft
        for (Node node : graph.getNodes()) {

View Full Code Here

            Node n = draftNode.getNode();
            NodeDraftGetter[] parents = draftNode.getParents();
            if (parents != null) {
                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }

View Full Code Here

                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }


        //Create all edges and push to data structure
        int edgeCount = 0;

View Full Code Here

            Node n = draftNode.getNode();
            NodeDraftGetter[] parents = draftNode.getParents();
            if (parents != null) {
                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }

View Full Code Here

                for (int i = 0; i < parents.length; i++) {
                    Node parent = parents[i].getNode();
                    graph.addNode(n, parent);
                }
            } else {
                graph.addNode(n);
            }
        }


        //Create all edges and push to data structure
        int edgeCount = 0;

View Full Code Here

            }
            for (int i = 0; i < graphs.length; i++) {
                if ((HierarchicalGraph) graphs[i] != maxHGraph) {
                    //Merge
                    for (Node n : ((HierarchicalGraph) graphs[i]).getNodes().toArray()) {
                        maxHGraph.addNode(n);
                    }
                    for (Edge e : ((HierarchicalGraph) graphs[i]).getEdgesAndMetaEdges().toArray()) {
                        maxHGraph.addEdge(e);
                    }
                }

View Full Code Here

            }
            for (int i = 0; i < graphs.length; i++) {
                if ((HierarchicalGraph) graphs[i] != maxHGraph) {
                    //Merge
                    for (Node n : ((HierarchicalGraph) graphs[i]).getNodes().toArray()) {
                        maxHGraph.addNode(n);
                    }
                    for (Edge e : ((HierarchicalGraph) graphs[i]).getEdgesAndMetaEdges().toArray()) {
                        maxHGraph.addEdge(e);
                    }
                }

View Full Code Here

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.