Examples of ptolemy.graph.DirectedGraph.topologicalSort()

ptolemy.graph.DirectedGraph.topologicalSort()

Sort a collection of graph nodes in their topological order as long as no two of the given nodes are mutually reachable by each other. This method uses the transitive closure matrix. Since generally the graph is checked for cyclicity before this method is called, the use of the transitive closure matrix should not add any overhead. A bubble sort is used for the internal implementation, so the complexity is O(V^2). @param nodeCollection The collection of nodes to be sorted;each element is a {@link Node}. @return The nodes in their sorted order in the form of a list;each element is a {@link Node}. @exception GraphActionException If any two nodes are stronglyconnected. @see #topologicalSort(Object[])

            List locallyModifiedAttributeList;


            try {
                DirectedGraph graph = _constAnalysis.getDependencyGraph();
                locallyModifiedAttributeList = Arrays.asList(Graph
                        .weightArray(graph.topologicalSort(graph
                                .nodes(locallyModifiedAttributeSet))));
            } catch (Exception ex) {
                throw new RuntimeException(ex);
            }

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.