Package org.gephi.graph.api

Examples of org.gephi.graph.api.Node

533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
    }

    @Test
    public void testInnerOuterEdgesDirected() {

        Node metaNode0 = graphGlobal2Directed.getTopNodes().toArray()[0];
        Node metaNode1 = graphGlobal2Directed.getTopNodes().toArray()[1];
        Node metaNode2 = graphGlobal2Directed.getTopNodes().toArray()[2];

        Node leaf2 = graphGlobal2Directed.getChildren(metaNode0).toArray()[0];
        Node leaf3 = graphGlobal2Directed.getChildren(metaNode0).toArray()[1];
        Node leaf5 = graphGlobal2Directed.getChildren(metaNode1).toArray()[0];
        Node leaf6 = graphGlobal2Directed.getChildren(metaNode1).toArray()[1];
        Node leaf8 = graphGlobal2Directed.getChildren(metaNode2).toArray()[0];
        Node leaf9 = graphGlobal2Directed.getChildren(metaNode2).toArray()[1];

        //Inner
        Edge[] innerEdges = graphGlobal2Directed.getInnerEdges(metaNode0).toArray();
        assertEquals(1, innerEdges.length);
        assertSame(graphGlobal2Directed.getEdge(leaf3, leaf2), innerEdges[0]);
View Full Code Here
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
    }

    @Test
    public void testInnerOuterEdgesUndirected() {

        Node metaNode0 = graphGlobal2Undirected.getTopNodes().toArray()[0];
        Node metaNode1 = graphGlobal2Undirected.getTopNodes().toArray()[1];
        Node metaNode2 = graphGlobal2Undirected.getTopNodes().toArray()[2];

        Node leaf2 = graphGlobal2Undirected.getChildren(metaNode0).toArray()[0];
        Node leaf3 = graphGlobal2Undirected.getChildren(metaNode0).toArray()[1];
        Node leaf5 = graphGlobal2Undirected.getChildren(metaNode1).toArray()[0];
        Node leaf6 = graphGlobal2Undirected.getChildren(metaNode1).toArray()[1];
        Node leaf8 = graphGlobal2Undirected.getChildren(metaNode2).toArray()[0];
        Node leaf9 = graphGlobal2Undirected.getChildren(metaNode2).toArray()[1];

        //Inner
        Edge[] innerEdges = graphGlobal2Undirected.getInnerEdges(metaNode0).toArray();
        assertEquals(1, innerEdges.length);
        assertSame(graphGlobal2Directed.getEdge(leaf3, leaf2), innerEdges[0]);
View Full Code Here
627
628
629
630
631
632
633
634
635
636
637
638
    public void testLevel() {
        //Height
        assertEquals(1, graphGlobal2Directed.getHeight());

        //Level
        Node nodeLevel0 = graphGlobal2Directed.getTopNodes().toArray()[0];
        Node nodeLevel1 = graphGlobal2Directed.getChildren(nodeLevel0).toArray()[0];
        assertEquals(0, graphGlobal2Directed.getLevel(nodeLevel0));
        assertEquals(1, graphGlobal2Directed.getLevel(nodeLevel1));

        //getNodes(level) 0
        assertArrayEquals(graphGlobal2Directed.getTopNodes().toArray(), graphGlobal2Directed.getNodes(0).toArray());
View Full Code Here
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
        TreeStructure treeStructure = dhns.getGraphStructure().getMainView().getStructure();
        HierarchicalDirectedGraphImpl graph = new HierarchicalDirectedGraphImpl(dhns, dhns.getGraphStructure().getMainView());
        GraphFactoryImpl factory = dhns.factory();

        //Add Node
        Node node1 = factory.newNode();
        Node node2 = factory.newNode();
        Node node3 = factory.newNode();
        Node node4 = factory.newNode();
        Node node5 = factory.newNode();
        Node node6 = factory.newNode();
        graph.addNode(node1);
        graph.addNode(node4);
        graph.addNode(node2, node1);
        graph.addNode(node3, node1);
        graph.addNode(node5, node4);
View Full Code Here
810
811
812
813
814
815
816
817
818
819
820
    public void testEdgesAndMetaEdges() {
        //dhnsGlobal2.getGraphStructure().getMainView().getStructure().showTreeAsTable();
        Edge[] metaedges = graphGlobal2Directed.getMetaEdges().toArray();
        int metaEdgesCount = metaedges.length;
        assertEquals(3, metaEdgesCount);
        Node parent0 = graphGlobal2Directed.getTopNodes().toArray()[0];
        graphGlobal2Directed.expand(parent0);
        assertEquals(4, graphGlobal2Directed.getMetaEdges().toArray().length);
        assertEquals(1, graphGlobal2Directed.getMetaEdges(nodeMap.get("Leaf 0")).toArray().length);
        assertEquals(1, graphGlobal2Directed.getMetaEdges(nodeMap.get("Leaf 1")).toArray().length);
        assertEquals(1, graphGlobal2Directed.getEdges().toArray().length);
View Full Code Here
837
838
839
840
841
842
843
844
845
846
847
848
849
        assertEquals(3, view.getEdgesCountEnabled());
        assertEquals(1, view.getMutualEdgesEnabled());
        assertEquals(1, view.getMutualEdgesTotal());
        assertEquals(3, view.getNodesEnabled());

        Node n1 = graphGlobal2Directed.getTopNodes().toArray()[0];
        Node n4 = graphGlobal2Directed.getTopNodes().toArray()[1];
        Node n7 = graphGlobal2Directed.getTopNodes().toArray()[2];

        AbstractEdge edge14 = (AbstractEdge) graphGlobal.getEdge(n1, n4);
        AbstractEdge edge47 = (AbstractEdge) graphGlobal.getEdge(n4, n7);
        AbstractEdge edge74 = (AbstractEdge) graphGlobal.getEdge(n7, n4);
        assertNotNull(edge14);
View Full Code Here
857
858
859
860
861
862
863
864
865
866
867
868
869
    }

    @Test
    public void testFlattenLeaves() {
        GraphViewImpl view = dhnsGlobal2.getGraphStructure().getMainView();
        Node n1 = graphGlobal2Directed.getTopNodes().toArray()[0];
        Node n4 = graphGlobal2Directed.getTopNodes().toArray()[1];
        Node n7 = graphGlobal2Directed.getTopNodes().toArray()[2];

        graphGlobal2Directed.expand(n1);
        graphGlobal2Directed.expand(n4);
        graphGlobal2Directed.expand(n7);
View Full Code Here
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
    @Test
    public void testEdgesCountingExpandRetract() {
        GraphViewImpl view = dhnsGlobal2.getGraphStructure().getMainView();
        assertEquals(0, view.getEdgesCountEnabled());
        assertEquals(10, view.getEdgesCountTotal());
        Node n1 = graphGlobal2Directed.getTopNodes().toArray()[0];
        graphGlobal2Directed.expand(n1);
        assertEquals(1, view.getEdgesCountEnabled());
        assertEquals(0, view.getMutualEdgesEnabled());
        assertEquals(1, nodeMap.get("Leaf 0").getEnabledInDegree());
        assertEquals(1, nodeMap.get("Leaf 1").getEnabledOutDegree());
        graphGlobal2Directed.retract(n1);
        assertEquals(0, view.getEdgesCountEnabled());
        assertEquals(0, nodeMap.get("Leaf 0").getEnabledInDegree());
        assertEquals(0, nodeMap.get("Leaf 1").getEnabledOutDegree());
        assertEquals(0, nodeMap.get("Leaf 0").getEnabledOutDegree());
        assertEquals(0, nodeMap.get("Leaf 1").getEnabledInDegree());
        assertEquals(0, view.getMutualEdgesEnabled());
        Node n7 = graphGlobal2Directed.getTopNodes().toArray()[2];
        graphGlobal2Directed.expand(n7);
        assertEquals(3, view.getEdgesCountEnabled());
        assertEquals(1, nodeMap.get("Leaf 4").getEnabledInDegree());
        assertEquals(1, nodeMap.get("Leaf 4").getEnabledOutDegree());
        assertEquals(2, nodeMap.get("Leaf 5").getEnabledOutDegree());
        assertEquals(2, nodeMap.get("Leaf 5").getEnabledInDegree());
        assertEquals(1, nodeMap.get("Leaf 4").getEnabledMutualDegree());
        assertEquals(1, nodeMap.get("Leaf 5").getEnabledMutualDegree());
        assertEquals(1, view.getMutualEdgesEnabled());
        graphGlobal2Directed.retract(n7);
        assertEquals(0, view.getEdgesCountEnabled());
        assertEquals(0, nodeMap.get("Leaf 4").getEnabledInDegree());
        assertEquals(0, nodeMap.get("Leaf 4").getEnabledOutDegree());
        assertEquals(0, nodeMap.get("Leaf 5").getEnabledOutDegree());
        assertEquals(0, nodeMap.get("Leaf 5").getEnabledInDegree());
        assertEquals(0, nodeMap.get("Leaf 4").getEnabledMutualDegree());
        assertEquals(0, nodeMap.get("Leaf 5").getEnabledMutualDegree());
        assertEquals(0, view.getMutualEdgesEnabled());
        Node n4 = graphGlobal2Directed.getTopNodes().toArray()[1];
        graphGlobal2Directed.expand(n4);
        graphGlobal2Directed.expand(n7);
        assertEquals(1, nodeMap.get("Leaf 2").getEnabledInDegree());
        assertEquals(1, nodeMap.get("Leaf 2").getEnabledOutDegree());
        assertEquals(1, nodeMap.get("Leaf 2").getEnabledMutualDegree());
View Full Code Here
983
984
985
986
987
988
989
990
991
992
993
    }

    @Test
    public void testEdgesCountingGrouping() {
        GraphViewImpl view = dhnsGlobal2.getGraphStructure().getMainView();
        Node n1 = graphGlobal2Directed.getTopNodes().toArray()[0];
        graphGlobal2Directed.ungroupNodes(n1);
        assertEquals(0, view.getMutualEdgesEnabled());
        assertEquals(1, view.getEdgesCountEnabled());
        graphGlobal2Directed.groupNodes(new Node[]{nodeMap.get("Leaf 0"), nodeMap.get("Leaf 1")});
        n1 = graphGlobal2Directed.getTopNodes().toArray()[2];
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
        colors = new HashMap<Node, Color>();
        distances = new HashMap<Node, Double>();
    }

    protected boolean relax(Edge edge) {
        Node source = edge.getSource();
        Node target = edge.getTarget();
        double distSource = distances.get(source);
        double distTarget = distances.get(target);
        double weight = edgeWeight(edge);

        double sourceWeight = distSource + weight;
View Full Code Here
TOP

Related Classes of org.gephi.graph.api.Node

  • bnGUI.util_GraphVisualizer
  • org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm
  • org.gephi.algorithms.shortestpath.BellmanFordShortestPathAlgorithm
  • org.gephi.algorithms.shortestpath.DijkstraShortestPathAlgorithm
  • org.gephi.clustering.plugin.mcl.MarkovClustering
  • org.gephi.data.attributes.serialization.AttributeRowSerializer
  • org.gephi.datalab.impl.AttributeColumnsControllerImpl
  • org.gephi.datalab.impl.GraphElementsControllerImpl
  • org.gephi.datalab.plugin.manipulators.edges.SelectSourceOnGraph
  • org.gephi.datalab.plugin.manipulators.edges.SelectTargetOnGraph
    • 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.