Uses of Interface
dev.nm.graph.Arc
-
Packages that use Arc Package Description dev.nm.graph dev.nm.graph.algorithm.traversal dev.nm.graph.type -
-
Uses of Arc in dev.nm.graph
Classes in dev.nm.graph with type parameters of type Arc Modifier and Type Interface Description interfaceDAGraph<V,E extends Arc<V>>A directed acyclic graph (DAG), is a directed graph with no directed cycles.interfaceDiGraph<V,E extends Arc<V>>A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.interfaceRootedTree<V,E extends Arc<V>>A rooted tree is a directed graph, and has a root to measure distance from the root.Subinterfaces of Arc in dev.nm.graph Modifier and Type Interface Description interfaceWeightedArc<V>A weighted arc is an arc that has a weight or a cost associated with it.Methods in dev.nm.graph with type parameters of type Arc Modifier and Type Method Description static <V,N,E extends Arc<N>>
DAGraph<N,E>GraphUtils. unDi2DAGraph(UnDiGraph<V,? extends UndirectedEdge<V>> g, V root, GraphUtils.EdgeFactory<V,N,E,UndirectedEdge<V>> edgeFactory)Converts an undirected graph into a directed acyclic graph, arcs are created from the edges by parent-child relations as determined by breadth-first-search.Methods in dev.nm.graph that return types with arguments of type Arc Modifier and Type Method Description static <V> DAGraph<V,Arc<V>>GraphUtils. unDi2DAGraph(UnDiGraph<V,? extends UndirectedEdge<V>> g, V root)Converts an undirected graph into a directed acyclic graph, arcs are created from the edges by parent-child relations as determined by breadth-first-search.Method parameters in dev.nm.graph with type arguments of type Arc Modifier and Type Method Description static <V> UnDiGraph<V,UndirectedEdge<V>>GraphUtils. di2UnDiGraph(DiGraph<V,? extends Arc<V>> diG)Converts a directed graph into an undirected graph by removing the direction of all arcs.static <V> Set<V>GraphUtils. getChildren(DiGraph<V,? extends Arc<V>> g, V v)Get the set of vertices that have an incoming arc coming from a vertex.static <V> Set<V>GraphUtils. getParents(DiGraph<V,? extends Arc<V>> g, V v)Get the set of vertices that have an outgoing arc pointing to a vertex.static <V> booleanGraphUtils. isStronglyConnected(DiGraph<V,? extends Arc<V>> g)Check whether a directed graph is strongly connected.static <V> intGraphUtils. numberOfChildren(DiGraph<V,? extends Arc<V>> g, V v)Gets the number of children.static <V> intGraphUtils. numberOfParents(DiGraph<V,? extends Arc<V>> g, V v)Gets the number of parents. -
Uses of Arc in dev.nm.graph.algorithm.traversal
Constructor parameters in dev.nm.graph.algorithm.traversal with type arguments of type Arc Constructor Description BottomUp(DAGraph<V,? extends Arc<V>> g)Constructs a BottomUp traversal instance. -
Uses of Arc in dev.nm.graph.type
Classes in dev.nm.graph.type with type parameters of type Arc Modifier and Type Class Description classSparseDAGraph<V,E extends Arc<V>>This class implements the sparse directed acyclic graph representation.classSparseDiGraph<V,E extends Arc<V>>This class implements the sparse directed graph representation.Classes in dev.nm.graph.type that implement Arc Modifier and Type Class Description classSimpleArc<V>A simple arc has two vertices: head and tail.Methods in dev.nm.graph.type that return types with arguments of type Arc Modifier and Type Method Description Set<Arc<V>>SparseTree. edges()Set<Arc<V>>SparseTree. edges(V v)Set<Arc<VertexTree<T>>>VertexTree. edges()Set<Arc<VertexTree<T>>>VertexTree. edges(VertexTree<T> v)Set<Arc<V>>SparseTree. incomingArcs(V v)Set<Arc<VertexTree<T>>>VertexTree. incomingArcs(VertexTree<T> v)Set<Arc<V>>SparseTree. outgoingArcs(V v)Set<Arc<VertexTree<T>>>VertexTree. outgoingArcs(VertexTree<T> v)RootedTree<V,Arc<V>>SparseTree. rotate(V v)This method re-pivots the tree with a new root vertex.RootedTree<V,Arc<V>>SparseTree. subTree(V v)RootedTree<VertexTree<T>,Arc<VertexTree<T>>>VertexTree. subTree(VertexTree<T> v)Methods in dev.nm.graph.type with parameters of type Arc Modifier and Type Method Description SparseTree<V>SparseTree. addEdge(Arc<V> e)Add an edge to the tree, connecting v1, the parent and v2..., the children.VertexTree<T>VertexTree. addEdge(Arc<VertexTree<T>> e)SparseTree<V>SparseTree. removeEdge(Arc<V> e)VertexTree<T>VertexTree. removeEdge(Arc<VertexTree<T>> e)
-