Uses of Interface
dev.nm.graph.UnDiGraph
-
Packages that use UnDiGraph Package Description dev.nm.graph dev.nm.graph.community dev.nm.graph.type -
-
Uses of UnDiGraph in dev.nm.graph
Methods in dev.nm.graph with type parameters of type UnDiGraph Modifier and Type Method Description static <V,E extends UndirectedEdge<V>,G extends UnDiGraph<V,E>>
List<G>GraphUtils. getDisjointGraphs(UnDiGraph<V,E> g, GraphUtils.GraphFactory<G> gCtor)
Separate an undirected graph into disjointed connected graphs.Methods in dev.nm.graph that return UnDiGraph 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.Methods in dev.nm.graph that return types with arguments of type UnDiGraph Modifier and Type Method Description static <V,E extends UndirectedEdge<V>>
List<UnDiGraph<V,E>>GraphUtils. getDisjointGraphs(UnDiGraph<V,E> g)
Methods in dev.nm.graph with parameters of type UnDiGraph Modifier and Type Method Description static <V,E extends UndirectedEdge<V>>
List<UnDiGraph<V,E>>GraphUtils. getDisjointGraphs(UnDiGraph<V,E> g)
static <V,E extends UndirectedEdge<V>,G extends UnDiGraph<V,E>>
List<G>GraphUtils. getDisjointGraphs(UnDiGraph<V,E> g, GraphUtils.GraphFactory<G> gCtor)
Separate an undirected graph into disjointed connected graphs.static <V> boolean
GraphUtils. isAcyclic(UnDiGraph<V,UndirectedEdge<V>> g)
Check if an undirected graph is acyclic.static <V> boolean
GraphUtils. isConnected(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Check whether an undirected graph is connected.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.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. -
Uses of UnDiGraph in dev.nm.graph.community
Classes in dev.nm.graph.community with type parameters of type UnDiGraph Modifier and Type Class Description class
GirvanNewman<V,E extends UndirectedEdge<V>,G extends UnDiGraph<V,E>>
The Girvan–Newman algorithm detects communities in complex systems.Methods in dev.nm.graph.community with parameters of type UnDiGraph Modifier and Type Method Description EdgeBetweeness<V>
GirvanNewman.EdgeBetweenessCtor. getEdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Construct an EdgeBetweeness from an undirected graph.Constructors in dev.nm.graph.community with parameters of type UnDiGraph Constructor Description EdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Computes the edge-betweeness-es of all edges in an undirected graph.GirvanNewman(UnDiGraph<V,E> g, GirvanNewman.EdgeBetweenessCtor<V> ebCtor, GraphUtils.GraphFactory<G> gCtor)
Construct an instance of the Girvan-Newman algorithm.GirvanNewmanUnDiGraph(UnDiGraph<V,E> g)
Construct an instance of the Girvan-Newman algorithm. -
Uses of UnDiGraph in dev.nm.graph.type
Classes in dev.nm.graph.type that implement UnDiGraph Modifier and Type Class Description class
SparseUnDiGraph<V,E extends UndirectedEdge<V>>
This class implements the sparse undirected graph representation.Constructors in dev.nm.graph.type with parameters of type UnDiGraph Constructor Description SparseUnDiGraph(UnDiGraph<V,E> g)
(Copy) construct a graph from another graph.
-