Uses of Interface
dev.nm.graph.Edge
-
Packages that use Edge Package Description dev.nm.graph dev.nm.graph.algorithm.traversal dev.nm.graph.type -
-
Uses of Edge in dev.nm.graph
Classes in dev.nm.graph with type parameters of type Edge Modifier and Type Interface Description static interfaceGraphUtils.EdgeFactory<V,N,E extends Edge<N>,X>This interface specifies how an edge is created for two nodes.Subinterfaces of Edge in dev.nm.graph Modifier and Type Interface Description interfaceArc<V>An arc is an ordered pair of vertices.interfaceUndirectedEdge<V>A tagging interface for implementations of an undirected graph that accept only undirected edges.interfaceWeightedArc<V>A weighted arc is an arc that has a weight or a cost associated with it. -
Uses of Edge in dev.nm.graph.algorithm.traversal
Fields in dev.nm.graph.algorithm.traversal with type parameters of type Edge Modifier and Type Field Description protected Graph<? extends V,? extends Edge<V>>TraversalFromRoots. gMethod parameters in dev.nm.graph.algorithm.traversal with type arguments of type Edge Modifier and Type Method Description static <V,W extends V>
List<BFS.Node<V>>BFS. BFS(Graph<W,? extends Edge<V>> g, V root, int time)Runs the breadth-first-search on a graph from a designated root.static <V,W extends V>
List<DFS.Node<V>>DFS. DFS(Graph<W,? extends Edge<V>> g, V root, int time)Runs the depth-first-search on a graph from a designated root.Constructor parameters in dev.nm.graph.algorithm.traversal with type arguments of type Edge Constructor Description BFS(Graph<V,? extends Edge<V>> g)Constructs a BFS tree of a graph.DFS(Graph<? extends V,? extends Edge<V>> g)Constructs a DFS tree of a graph.TraversalFromRoots(Graph<? extends V,? extends Edge<V>> g)Constructs a traversal order of a graph. -
Uses of Edge in dev.nm.graph.type
Classes in dev.nm.graph.type that implement Edge Modifier and Type Class Description classSimpleArc<V>A simple arc has two vertices: head and tail.classSimpleEdge<V>A simple edge has two vertices.
-