Examples of UndirectedGraph

edu.uci.ics.jung.graph.UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.
org._3pq.jgrapht.UndirectedGraph
org.gephi.graph.api.UndirectedGraph
Graph with only undirected edges. Note that undirected graph can be obtained even if all edges are directed. The graph is just taking care to ignore opposite edges. @author Mathieu Bastian @see GraphModel
util.objects.graphs.UndirectedGraph
Specific implementation of an undirected graph @author Jean-Guillaume Fages, Xavier Lorca

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testTwoConnectedNodesEigenvectorCentrality() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(2);
        UndirectedGraph hgraph = graphModel.getUndirectedGraph();


        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[2];


        HashMap<Integer, Node> indicies = new HashMap();
        HashMap<Node, Integer> invIndicies = new HashMap();


        ec.fillIndiciesMaps(hgraph, centralities, indicies, invIndicies);


        ec.calculateEigenvectorCentrality(hgraph, centralities, indicies, invIndicies, false, 100);


        Node n1 = hgraph.getNode("0");
        int index = invIndicies.get(n1);
        double ec1 = centralities[index];


        assertEquals(ec1, 1.0);
    }

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testNullGraphEigenvectorCentrality() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);
        UndirectedGraph hgraph = graphModel.getUndirectedGraph();


        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[5];


        HashMap<Integer, Node> indicies = new HashMap();
        HashMap<Node, Integer> invIndicies = new HashMap();


        ec.fillIndiciesMaps(hgraph, centralities, indicies, invIndicies);


        ec.calculateEigenvectorCentrality(hgraph, centralities, indicies, invIndicies, false, 100);


        Node n2 = hgraph.getNode("1");
        int index = invIndicies.get(n2);
        double ec2 = centralities[index];


        assertEquals(ec2, 0.0);
    }

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testCompleteUndirectedGraphEigenvectorCentrality() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);
        UndirectedGraph hgraph = graphModel.getUndirectedGraph();


        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[5];


        HashMap<Integer, Node> indicies = new HashMap();
        HashMap<Node, Integer> invIndicies = new HashMap();


        ec.fillIndiciesMaps(hgraph, centralities, indicies, invIndicies);


        ec.calculateEigenvectorCentrality(hgraph, centralities, indicies, invIndicies, false, 100);


        Node n1 = hgraph.getNode("0");
        Node n3 = hgraph.getNode("2");
        int index1 = invIndicies.get(n1);
        int index3 = invIndicies.get(n3);
        double ec1 = centralities[index1];
        double ec3 = centralities[index3];

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testSpecial1UndirectedGraphEigenvectorCentrlity() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();


        Node node1 = graphModel.factory().newNode("0");
        Node node2 = graphModel.factory().newNode("1");
        Node node3 = graphModel.factory().newNode("2");
        Node node4 = graphModel.factory().newNode("3");


        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);


        Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
        Edge edge23 = graphModel.factory().newEdge(node2, node3, false);
        Edge edge34 = graphModel.factory().newEdge(node3, node4, false);
        Edge edge13 = graphModel.factory().newEdge(node1, node3, false);
        Edge edge24 = graphModel.factory().newEdge(node2, node4, false);


        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge23);
        undirectedGraph.addEdge(edge34);
        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge24);


        UndirectedGraph hgraph = graphModel.getUndirectedGraph();
        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[4];


        HashMap<Integer, Node> indicies = new HashMap();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testSpecial2UndirectedGraphEigenvectorCentrlity() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();


        Node node1 = graphModel.factory().newNode("0");
        Node node2 = graphModel.factory().newNode("1");
        Node node3 = graphModel.factory().newNode("2");
        Node node4 = graphModel.factory().newNode("3");
        Node node5 = graphModel.factory().newNode("4");


        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);


        Edge edge13 = graphModel.factory().newEdge(node1, node3, false);
        Edge edge23 = graphModel.factory().newEdge(node2, node3, false);
        Edge edge34 = graphModel.factory().newEdge(node3, node4, false);
        Edge edge45 = graphModel.factory().newEdge(node4, node5, false);


        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge23);
        undirectedGraph.addEdge(edge34);
        undirectedGraph.addEdge(edge45);


        UndirectedGraph hgraph = graphModel.getUndirectedGraph();
        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[5];


        HashMap<Integer, Node> indicies = new HashMap();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testSpecial3UndirectedGraphEigenvectorCentrlity() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();


        Node node1 = graphModel.factory().newNode("0");
        Node node2 = graphModel.factory().newNode("1");
        Node node3 = graphModel.factory().newNode("2");


        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);


        Edge edge11 = graphModel.factory().newEdge(node1, node1, false);
        Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
        Edge edge23 = graphModel.factory().newEdge(node2, node3, false);
        Edge edge33 = graphModel.factory().newEdge(node3, node3, false);


        undirectedGraph.addEdge(edge11);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge23);
        undirectedGraph.addEdge(edge33);


        UndirectedGraph hgraph = graphModel.getUndirectedGraph();
        EigenvectorCentrality ec = new EigenvectorCentrality();


        double[] centralities = new double[3];


        HashMap<Integer, Node> indicies = new HashMap();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testOneNodeAvPathLength() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(1);


        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);


        d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);


        double averageDegree = d.getPathLength();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testTwoConnectedNodesAvPathLength() {
        GraphModel graphModel = GraphGenerator.generatePathUndirectedGraph(2);


        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);


        d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);


        double averageDegree = d.getPathLength();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testNullGraphAvPathLength() {
        GraphModel graphModel = GraphGenerator.generateNullUndirectedGraph(5);


        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);


        d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);


        double averageDegree = d.getPathLength();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testCompleteGraphAvPathLength() {
        GraphModel graphModel = GraphGenerator.generateCompleteUndirectedGraph(5);


        GraphDistance d = new GraphDistance();
        d.initializeStartValues();
        UndirectedGraph undirectedGraph = graphModel.getUndirectedGraph();
        HashMap<Node, Integer> indicies = d.createIndiciesMap(undirectedGraph);


        d.calculateDistanceMetrics(graphModel.getGraph(), indicies, false, false);


        double averageDegree = d.getPathLength();

View Full Code Here

0 1 2 3 4 5

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.