Uses of Package
dev.nm.graph
-
Packages that use dev.nm.graph Package Description dev.nm.graph dev.nm.graph.algorithm.shortestpath dev.nm.graph.algorithm.traversal dev.nm.graph.community dev.nm.graph.type -
Classes in dev.nm.graph used by dev.nm.graph Class Description Arc An arc is an ordered pair of vertices.DAGraph A directed acyclic graph (DAG), is a directed graph with no directed cycles.DiGraph A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.Edge An edge connects a pair of vertices.Graph A graph is a representation of a set of objects where some pairs of the objects are connected by links.GraphUtils.EdgeFactory This interface specifies how an edge is created for two nodes.GraphUtils.GraphFactory The factory to construct instances of the graph type.HyperEdge A hyper-edge connects a set of vertices of any size.RootedTree A rooted tree is a directed graph, and has a root to measure distance from the root.Tree A tree is an undirected graph in which any two vertices are connected by exactly one simple path.UnDiGraph An undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a).UndirectedEdge A tagging interface for implementations of an undirected graph that accept only undirected edges.WeightedEdge A weighted edge has a weight or a cost associated with it. -
Classes in dev.nm.graph used by dev.nm.graph.algorithm.shortestpath Class Description DiGraph A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.WeightedArc A weighted arc is an arc that has a weight or a cost associated with it.WeightedEdge A weighted edge has a weight or a cost associated with it. -
Classes in dev.nm.graph used by dev.nm.graph.algorithm.traversal Class Description Arc An arc is an ordered pair of vertices.DAGraph A directed acyclic graph (DAG), is a directed graph with no directed cycles.Edge An edge connects a pair of vertices.Graph A graph is a representation of a set of objects where some pairs of the objects are connected by links. -
Classes in dev.nm.graph used by dev.nm.graph.community Class Description GraphUtils.GraphFactory The factory to construct instances of the graph type.UnDiGraph An undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a).UndirectedEdge A tagging interface for implementations of an undirected graph that accept only undirected edges. -
Classes in dev.nm.graph used by dev.nm.graph.type Class Description Arc An arc is an ordered pair of vertices.DAGraph A directed acyclic graph (DAG), is a directed graph with no directed cycles.DiGraph A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.Edge An edge connects a pair of vertices.Graph A graph is a representation of a set of objects where some pairs of the objects are connected by links.HyperEdge A hyper-edge connects a set of vertices of any size.RootedTree A rooted tree is a directed graph, and has a root to measure distance from the root.Tree A tree is an undirected graph in which any two vertices are connected by exactly one simple path.UnDiGraph An undirected graph is a graph, or set of nodes connected by edges, where an edge does not differentiate between (a, b) or (b, a).UndirectedEdge A tagging interface for implementations of an undirected graph that accept only undirected edges.WeightedArc A weighted arc is an arc that has a weight or a cost associated with it.WeightedEdge A weighted edge has a weight or a cost associated with it.