Uses of Interface
org.apache.flex.compiler.internal.graph.IGraphEdge

Packages that use IGraphEdge

Package	Description
org.apache.flex.compiler.internal.graph

Uses of IGraphEdge in org.apache.flex.compiler.internal.graph

Classes in org.apache.flex.compiler.internal.graph with type parameters of type IGraphEdge

Modifier and Type	Class and Description
class	Graph<V,E extends IGraphEdge<V>> Implementation of IGraph.
interface	IGraph<V,E extends IGraphEdge<V>> Interface to a generic graph.
class	SynchronizedGraph<V,E extends IGraphEdge<V>> Thread safe implementation of IGraph.
static interface	TopologicalSort.IVisitor<V,E extends IGraphEdge<V>> IVisitor interface implemented by callers of the TopologicalSort.sort(org.apache.flex.compiler.internal.graph.IGraph<V, E>, java.util.Collection<V>, org.apache.flex.compiler.internal.graph.TopologicalSort.IVisitor<V, E>) method.

Classes in org.apache.flex.compiler.internal.graph that implement IGraphEdge

Modifier and Type	Class and Description
class	GraphEdge<V> Simple implementation of IGraphEdge.

Methods in org.apache.flex.compiler.internal.graph with type parameters of type IGraphEdge

Modifier and Type	Method and Description
static <V,E extends IGraphEdge<V>> void	TopologicalSort.sort(IGraph<V,E> graph, Collection<V> rootedVertices, TopologicalSort.IVisitor<V,E> visitor) Topologically sorts nodes in an IGraph.
static <V,E extends IGraphEdge<V>> List<V>	TopologicalSort.sort(IGraph<V,E> graph, Comparator<V> vertexComparator) Convenience wrapper for TopologicalSort.sort(IGraph, Collection, IVisitor) that topologically sorts all vertices in a graph and returns a list of all the vertices in topological order.