Examples of DirectedGraph

com.sparc.knappsack.models.reports.DirectedGraph
de.hpi.bpt.graph.DirectedGraph
org._3pq.jgrapht.DirectedGraph
org.eclipse.draw2d.graph.DirectedGraph
org.gephi.graph.api.DirectedGraph
Graph with directed edges. @author Mathieu Bastian @see GraphModel
ptolemy.graph.DirectedGraph
A directed graph. Some methods in this class have two versions, one that operates on graph nodes, and another that operates on node weights. The latter form is called the weights version. More specifically, the weights version of an operation takes individual node weights or arrays of weights as arguments, and, when applicable, returns individual weights or arrays of weights.
Multiple edges in a graph can be directed between the same pair of nodes. Thus, directed multigraphs are supported. @author Yuhong Xiong, Jie Liu, Paul Whitaker, Shuvra S. Bhattacharyya,Shahrooz Shahparnia @version $Id: DirectedGraph.java,v 1.121 2006/03/29 00:01:03 cxh Exp $ @since Ptolemy II 0.2 @Pt.ProposedRating Yellow (pwhitake) @Pt.AcceptedRating Yellow (pwhitake)
util.objects.graphs.DirectedGraph
Directed graph implementation : arcs are indexed per endpoints @author Jean-Guillaume Fages, Xavier Lorca

Examples of org.gephi.graph.api.DirectedGraph

        projectController.newProject();
        AttributeController attributeController = Lookup.getDefault().lookup(AttributeController.class);
        attributeModel = attributeController.getModel();
        GraphController graphController = Lookup.getDefault().lookup(GraphController.class);
        graphModel = graphController.getModel();
        DirectedGraph graph = graphModel.getDirectedGraph();


        for (int i = 0; i < NODES; i++) {
            Node newNode = graphModel.factory().newNode();
            graph.addNode(newNode);
        }


        Random random = new Random();
        int j = 0;
        while (j < EDGES) {
            Node source = graph.getNode(random.nextInt(NODES));
            Node target = graph.getNode(random.nextInt(NODES));
            if (graph.getEdge(source, target) == null) {
                graph.addEdge(graphModel.factory().newEdge(source, target));
                j++;
            }
        }
    }

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

                }
                writer.append(EOL);
            }
        } else {
            if (graph instanceof DirectedGraph) {
                DirectedGraph directedGraph = (DirectedGraph) graph;
                Node[] nodes = graph.getNodes().toArray();
                for (Node n : nodes) {
                    if (cancel) {
                        break;
                    }
                    writeMatrixNode(n, true);
                    for (int j = 0; j < nodes.length; j++) {
                        Node m = nodes[j];
                        Edge e = directedGraph.getEdge(n, m);
                        e = e == null ? ((HierarchicalDirectedGraph) directedGraph).getMetaEdge(n, m) : e;
                        writeEdge(e, j < nodes.length - 1);
                    }
                    Progress.progress(progressTicket);
                    writer.append(EOL);

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

        return graph instanceof DirectedGraph;
    }


    @Override
    public boolean evaluate(Graph graph, Edge edge) {
        DirectedGraph directedGraph = (DirectedGraph) graph;


        //Make sure the edge is not  self loop
        if (!edge.isSelfLoop()) {
            //Get the potential mutual edge
            Edge mutualEdge = directedGraph.getEdge(edge.getTarget(), edge.getSource());


            //Remove the mutual edge if exists
            //Make sure only one of the two mutual edges will bre removed
            if (mutualEdge != null && mutualEdge.getId() < edge.getId()) {
                return false;

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

   
   @Test 
    public void testSpecial1DirectedGraphClusteringCoefficient() {
        GraphModel graphModel=Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        
        DirectedGraph directedGraph=graphModel.getDirectedGraph();
        
        Node node1=graphModel.factory().newNode("0");
        Node node2=graphModel.factory().newNode("1");
        Node node3=graphModel.factory().newNode("2");
        Node node4=graphModel.factory().newNode("3");
        
        directedGraph.addNode(node1);
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        
        Edge edge12=graphModel.factory().newEdge(node1, node2);
        Edge edge23=graphModel.factory().newEdge(node2, node3);
        Edge edge24=graphModel.factory().newEdge(node2, node4);
        Edge edge31=graphModel.factory().newEdge(node3, node1);
        Edge edge34=graphModel.factory().newEdge(node3, node4);
        Edge edge41=graphModel.factory().newEdge(node4, node1);
         
        directedGraph.addEdge(edge12);
        directedGraph.addEdge(edge23);
        directedGraph.addEdge(edge24);
        directedGraph.addEdge(edge31);
        directedGraph.addEdge(edge34);
        directedGraph.addEdge(edge41);
        
        
        DirectedGraph hgraph = graphModel.getDirectedGraph();
        
        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[4];
        int[] triangles = new int[4];
        double[] nodeClustering = new double[4];

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

   
   @Test 
    public void testTriangleDirectedGraphClusteringCoefficient() {
        GraphModel graphModel=Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        
        DirectedGraph directedGraph=graphModel.getDirectedGraph();
        
        Node node1=graphModel.factory().newNode("0");
        Node node2=graphModel.factory().newNode("1");
        Node node3=graphModel.factory().newNode("2");
        
        directedGraph.addNode(node1);
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        
        Edge edge12=graphModel.factory().newEdge(node1, node2);
        Edge edge21=graphModel.factory().newEdge(node2, node1);
        Edge edge23=graphModel.factory().newEdge(node2, node3);
        Edge edge32=graphModel.factory().newEdge(node3, node2);
        Edge edge31=graphModel.factory().newEdge(node3, node1);
        Edge edge13=graphModel.factory().newEdge(node1, node3);
         
        directedGraph.addEdge(edge12);
        directedGraph.addEdge(edge21);
        directedGraph.addEdge(edge23);
        directedGraph.addEdge(edge32);
        directedGraph.addEdge(edge31);
        directedGraph.addEdge(edge13);
        
        
        DirectedGraph hgraph = graphModel.getDirectedGraph();
        
        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[3];
        int[] triangles = new int[3];
        double[] nodeClustering = new double[3];

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

   
   @Test 
    public void testSpecial2DirectedGraphClusteringCoefficient() {
        GraphModel graphModel=Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        
        DirectedGraph directedGraph=graphModel.getDirectedGraph();
        
        Node node1=graphModel.factory().newNode("0");
        Node node2=graphModel.factory().newNode("1");
        Node node3=graphModel.factory().newNode("2");
        Node node4=graphModel.factory().newNode("3");
        
        directedGraph.addNode(node1);
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        
        Edge edge21=graphModel.factory().newEdge(node2, node1);
        Edge edge24=graphModel.factory().newEdge(node2, node4);
        Edge edge31=graphModel.factory().newEdge(node3, node1);
        Edge edge32=graphModel.factory().newEdge(node3, node2);
        Edge edge43=graphModel.factory().newEdge(node4, node3);
         
        directedGraph.addEdge(edge21);
        directedGraph.addEdge(edge24);
        directedGraph.addEdge(edge31);
        directedGraph.addEdge(edge32);
        directedGraph.addEdge(edge43);
        
        
        DirectedGraph hgraph = graphModel.getDirectedGraph();
        
        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[4];
        int[] triangles = new int[4];
        double[] nodeClustering = new double[4];

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

   
    @Test 
    public void testTriangleNonCompleteDirectedGraphClusteringCoefficient() {
        GraphModel graphModel=Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        
        DirectedGraph directedGraph=graphModel.getDirectedGraph();
        
        Node node1=graphModel.factory().newNode("0");
        Node node2=graphModel.factory().newNode("1");
        Node node3=graphModel.factory().newNode("2");
        
        directedGraph.addNode(node1);
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        
        Edge edge12=graphModel.factory().newEdge(node1, node2);
        Edge edge21=graphModel.factory().newEdge(node2, node1);
        Edge edge23=graphModel.factory().newEdge(node2, node3);
        Edge edge32=graphModel.factory().newEdge(node3, node2);
        Edge edge13=graphModel.factory().newEdge(node1, node3);
         
        directedGraph.addEdge(edge12);
        directedGraph.addEdge(edge21);
        directedGraph.addEdge(edge23);
        directedGraph.addEdge(edge32);
        directedGraph.addEdge(edge13);
        
        
        DirectedGraph hgraph = graphModel.getDirectedGraph();
        
        ClusteringCoefficient cc = new ClusteringCoefficient();
        ArrayWrapper[] network = new ArrayWrapper[3];
        int[] triangles = new int[3];
        double[] nodeClustering = new double[3];

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

    }


    @Test
    public void testDirectedPathGraphConnectedComponents() {
        GraphModel graphModel = GraphGenerator.generatePathDirectedGraph(4);
        DirectedGraph graph = graphModel.getDirectedGraph();


        ConnectedComponents c = new ConnectedComponents();
        HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
        LinkedList<LinkedList<Node>> components = c.top_tarjans(graph, indicies);
        assertEquals(components.size(), 4);

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

    }


    @Test
    public void testDirectedCyclicGraphConnectedComponents() {
        GraphModel graphModel = GraphGenerator.generateCyclicDirectedGraph(5);
        DirectedGraph graph = graphModel.getDirectedGraph();


        ConnectedComponents c = new ConnectedComponents();
        HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
        LinkedList<LinkedList<Node>> components = c.top_tarjans(graph, indicies);
        assertEquals(components.size(), 1);

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

    }


    @Test
    public void testSpecial1DirectedGraphConnectedComponents() {
        GraphModel graphModel = Lookup.getDefault().lookup(GraphController.class).getGraphModel();
        DirectedGraph directedGraph = graphModel.getDirectedGraph();
        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");
        directedGraph.addNode(node1);
        directedGraph.addNode(node2);
        directedGraph.addNode(node3);
        directedGraph.addNode(node4);
        directedGraph.addNode(node5);
        Edge edge12 = graphModel.factory().newEdge(node1, node2);
        Edge edge14 = graphModel.factory().newEdge(node1, node4);
        Edge edge23 = graphModel.factory().newEdge(node2, node3);
        Edge edge25 = graphModel.factory().newEdge(node2, node5);
        Edge edge35 = graphModel.factory().newEdge(node3, node5);
        Edge edge43 = graphModel.factory().newEdge(node4, node3);
        Edge edge51 = graphModel.factory().newEdge(node5, node1);
        Edge edge54 = graphModel.factory().newEdge(node5, node4);
        directedGraph.addEdge(edge12);
        directedGraph.addEdge(edge14);
        directedGraph.addEdge(edge23);
        directedGraph.addEdge(edge25);
        directedGraph.addEdge(edge35);
        directedGraph.addEdge(edge43);
        directedGraph.addEdge(edge51);
        directedGraph.addEdge(edge54);


        DirectedGraph graph = graphModel.getDirectedGraph();


        ConnectedComponents c = new ConnectedComponents();
        HashMap<Node, Integer> indicies = c.createIndiciesMap(graph);
        LinkedList<LinkedList<Node>> components = c.top_tarjans(graph, indicies);
        assertEquals(components.size(), 1);

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.