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.eclipse.draw2d.graph.DirectedGraph

    }


    private void execute() {
        editor.doSave(null);
        Map<Long, Node> mapping = new HashMap<Long, Node>();
        DirectedGraph graph = createDirectedGraph(mapping);
        DirectedGraphLayout layout = new DirectedGraphLayout();
        layout.visit(graph);
        for (Map.Entry<Long, Node> entry: mapping.entrySet()) {
            Node node = entry.getValue();
            DefaultElementWrapper elementWrapper = (DefaultElementWrapper)

View Full Code Here

Examples of org.eclipse.draw2d.graph.DirectedGraph

        // TODO: implement changes as a command, so we can support undo
        editor.doSave(null);
    }
    
    protected DirectedGraph createDirectedGraph(Map<Long, Node> mapping) {
        DirectedGraph graph = new DirectedGraph();
        WorkflowProcess process = (WorkflowProcess) ((ProcessWrapper) ((GenericModelEditor) editor).getModel()).getProcess();
        for (org.drools.definition.process.Node processNode: process.getNodes()) {
            Node node = new Node();
            Integer width = (Integer) processNode.getMetaData("width");
            Integer height = (Integer) processNode.getMetaData("height");

View Full Code Here

Examples of org.eclipse.draw2d.graph.DirectedGraph

 * Action for auto layouting a RuleFlow.
 */
public class HorizontalAutoLayoutAction extends VerticalAutoLayoutAction {


    protected DirectedGraph createDirectedGraph(Map<Long, Node> mapping) {
        DirectedGraph graph = super.createDirectedGraph(mapping);
        graph.setDirection(PositionConstants.HORIZONTAL);
        return graph;
    }

View Full Code Here

Examples of org.eclipse.draw2d.graph.DirectedGraph

    private Map partToNodesMap;
    private DirectedGraph graph;


    public void layoutDiagram(ProcessEditPart diagram) {
        partToNodesMap = new HashMap();
        graph = new DirectedGraph();
        addNodes(diagram);
        if (graph.nodes.size() > 0) {
            addEdges(diagram);
            new DirectedGraphLayout().visit(graph);
            applyResults(diagram);

View Full Code Here

Examples of org.eclipse.draw2d.graph.DirectedGraph

    }


    private void execute() {
        editor.doSave(null);
        Map<Long, Node> mapping = new HashMap<Long, Node>();
        DirectedGraph graph = createDirectedGraph(mapping);
        DirectedGraphLayout layout = new DirectedGraphLayout();
        layout.visit(graph);
        for (Map.Entry<Long, Node> entry: mapping.entrySet()) {
            Node node = entry.getValue();
            DefaultElementWrapper elementWrapper = (DefaultElementWrapper)

View Full Code Here

Examples of org.eclipse.draw2d.graph.DirectedGraph

        // TODO: implement changes as a command, so we can support undo
        editor.doSave(null);
    }
    
    protected DirectedGraph createDirectedGraph(Map<Long, Node> mapping) {
        DirectedGraph graph = new DirectedGraph();
        WorkflowProcess process = (WorkflowProcess) ((ProcessWrapper) ((GenericModelEditor) editor).getModel()).getProcess();
        for (org.kie.api.definition.process.Node processNode: process.getNodes()) {
            Node node = new Node();
            Integer width = (Integer) processNode.getMetaData().get("width");
            Integer height = (Integer) processNode.getMetaData().get("height");

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

                    }
                    GraphController gc = Lookup.getDefault().lookup(GraphController.class);


                    AbstractShortestPathAlgorithm algorithm;
                    if (gc.getModel().getGraphVisible() instanceof DirectedGraph) {
                        DirectedGraph graph = (DirectedGraph) gc.getModel().getGraphVisible();
                        algorithm = new BellmanFordShortestPathAlgorithm(graph, n);
                        algorithm.compute();
                    } else {
                        Graph graph = gc.getModel().getGraphVisible();
                        algorithm = new DijkstraShortestPathAlgorithm(graph, n);

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

        return null;
    }


    public NodeRanking getInDegreeRanking() {
        GraphModel model = Lookup.getDefault().lookup(GraphController.class).getModel();
        DirectedGraph graph = model.getDirectedGraphVisible();
        NodeRanking degreeRanking = RankingFactory.getNodeInDegreeRanking(graph);
        if (degreeRanking.getMinimumValue() != null && degreeRanking.getMaximumValue() != null && !degreeRanking.getMinimumValue().equals(degreeRanking.getMaximumValue())) {
            return degreeRanking;
        }
        return null;

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

        return null;
    }


    public NodeRanking getOutDegreeRanking() {
        GraphModel model = Lookup.getDefault().lookup(GraphController.class).getModel();
        DirectedGraph graph = model.getDirectedGraphVisible();
        NodeRanking degreeRanking = RankingFactory.getNodeOutDegreeRanking(graph);
        if (degreeRanking.getMinimumValue() != null && degreeRanking.getMaximumValue() != null && !degreeRanking.getMinimumValue().equals(degreeRanking.getMaximumValue())) {
            return degreeRanking;
        }
        return null;

View Full Code Here

Examples of org.gephi.graph.api.DirectedGraph

        if (degreeRanking.getMinimumValue() != null && degreeRanking.getMaximumValue() != null && !degreeRanking.getMinimumValue().equals(degreeRanking.getMaximumValue())) {
            rankingList.add(degreeRanking);
        }


        if (model.isDirected()) {
            DirectedGraph directedGraph = model.getDirectedGraphVisible();
            NodeRanking inDegreeRanking = RankingFactory.getNodeInDegreeRanking(directedGraph);
            if (inDegreeRanking.getMinimumValue() != null && inDegreeRanking.getMaximumValue() != null && !inDegreeRanking.getMinimumValue().equals(inDegreeRanking.getMaximumValue())) {
                rankingList.add(inDegreeRanking);
            }
            NodeRanking outDegreeRanking = RankingFactory.getNodeOutDegreeRanking(directedGraph);

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.