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

    public void testCyclicGraphDiameter() {
        GraphModel graphModel = GraphGenerator.generateCyclicUndirectedGraph(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 diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testSpecial1UndirectedGraphDiameter() {
        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");
        Node node6 = graphModel.factory().newNode("5");
        Node node7 = graphModel.factory().newNode("6");
        Node node8 = graphModel.factory().newNode("7");
        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);
        undirectedGraph.addNode(node6);
        undirectedGraph.addNode(node7);
        undirectedGraph.addNode(node8);
        Edge edge12 = graphModel.factory().newEdge(node1, node2, false);
        Edge edge13 = graphModel.factory().newEdge(node1, node3, false);
        Edge edge34 = graphModel.factory().newEdge(node3, node4, false);
        Edge edge24 = graphModel.factory().newEdge(node2, node4, false);
        Edge edge56 = graphModel.factory().newEdge(node5, node6, false);
        Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
        Edge edge78 = graphModel.factory().newEdge(node7, node8, false);
        Edge edge85 = graphModel.factory().newEdge(node8, node5, false);
        Edge edge45 = graphModel.factory().newEdge(node4, node5, false);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge13);
        undirectedGraph.addEdge(edge34);
        undirectedGraph.addEdge(edge24);
        undirectedGraph.addEdge(edge56);
        undirectedGraph.addEdge(edge67);
        undirectedGraph.addEdge(edge78);
        undirectedGraph.addEdge(edge85);
        undirectedGraph.addEdge(edge45);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    }


    @Test
    public void testSpecial2UndirectedGraphDiameter() {
        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");
        Node node6 = graphModel.factory().newNode("5");
        Node node7 = graphModel.factory().newNode("6");
        Node node8 = graphModel.factory().newNode("7");
        undirectedGraph.addNode(node1);
        undirectedGraph.addNode(node2);
        undirectedGraph.addNode(node3);
        undirectedGraph.addNode(node4);
        undirectedGraph.addNode(node5);
        undirectedGraph.addNode(node6);
        undirectedGraph.addNode(node7);
        undirectedGraph.addNode(node8);
        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 edge45 = graphModel.factory().newEdge(node4, node5, false);
        Edge edge56 = graphModel.factory().newEdge(node5, node6, false);
        Edge edge67 = graphModel.factory().newEdge(node6, node7, false);
        Edge edge78 = graphModel.factory().newEdge(node7, node8, false);
        Edge edge81 = graphModel.factory().newEdge(node8, node1, false);
        Edge edge14 = graphModel.factory().newEdge(node1, node4, false);
        Edge edge85 = graphModel.factory().newEdge(node8, node5, false);
        undirectedGraph.addEdge(edge12);
        undirectedGraph.addEdge(edge23);
        undirectedGraph.addEdge(edge34);
        undirectedGraph.addEdge(edge45);
        undirectedGraph.addEdge(edge56);
        undirectedGraph.addEdge(edge67);
        undirectedGraph.addEdge(edge78);
        undirectedGraph.addEdge(edge81);
        undirectedGraph.addEdge(edge14);
        undirectedGraph.addEdge(edge85);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testDirectedPathGraphDiameter() {
        GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(4);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testDirectedCyclicDiameter() {
        GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

        directedGraph.addEdge(edge85);
        directedGraph.addEdge(edge45);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

        directedGraph.addEdge(edge51);
        directedGraph.addEdge(edge54);


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


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


        double diameter = d.getDiameter();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testOneNodeRadius() {
        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 radius = d.getRadius();

View Full Code Here

Examples of org.gephi.graph.api.UndirectedGraph

    public void testTwoConnectrdNodesRadius() {
        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 radius = d.getRadius();

View Full Code Here

Examples of util.objects.graphs.UndirectedGraph

   * @param filters  filtering algorithm to use
   */
  public PropGraphCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa,
                 boolean fast, Cumulative.Filter... filters) {
    super(s, d, e, h, capa,true,fast, filters);
    this.g = new UndirectedGraph(n, SetType.BITSET, true);
    this.tasks = SetFactory.makeSwap(n,false);
    this.toCompute = SetFactory.makeSwap(n, false);
  }

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.