Uses of Interface
dev.nm.graph.UndirectedEdge
-
Packages that use UndirectedEdge Package Description dev.nm.graph dev.nm.graph.community dev.nm.graph.type -
-
Uses of UndirectedEdge in dev.nm.graph
Classes in dev.nm.graph with type parameters of type UndirectedEdge Modifier and Type Interface Description interface
UnDiGraph<V,E extends UndirectedEdge<V>>
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).Methods in dev.nm.graph with type parameters of type UndirectedEdge 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.Methods in dev.nm.graph that return types with arguments of type UndirectedEdge 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.Method parameters in dev.nm.graph with type arguments of type UndirectedEdge Modifier and Type Method Description 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.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 UndirectedEdge in dev.nm.graph.community
Classes in dev.nm.graph.community with type parameters of type UndirectedEdge 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.class
GirvanNewmanUnDiGraph<V,E extends UndirectedEdge<V>>
Methods in dev.nm.graph.community that return UndirectedEdge Modifier and Type Method Description UndirectedEdge<V>
EdgeBetweeness. maxEdge()
Gets the edge with the maximal edge-betweeness.UndirectedEdge<V>
GirvanNewman. maxEdge()
Gets the edge with the maximal edge-betweeness.Methods in dev.nm.graph.community that return types with arguments of type UndirectedEdge Modifier and Type Method Description Set<UndirectedEdge<V>>
EdgeBetweeness. edges()
Gets the set of all edges in the graph.Methods in dev.nm.graph.community with parameters of type UndirectedEdge Modifier and Type Method Description boolean
EdgeBetweeness. contains(UndirectedEdge<V> edge)
Checks if the graph contains an edge.double
EdgeBetweeness. value(UndirectedEdge<V> edge)
Gets the edge-betweeness of an edge.double
GirvanNewman. value(UndirectedEdge<V> edge)
Get the edge-betweeness of an edge.Method parameters in dev.nm.graph.community with type arguments of type UndirectedEdge Modifier and Type Method Description EdgeBetweeness<V>
GirvanNewman.EdgeBetweenessCtor. getEdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Construct an EdgeBetweeness from an undirected graph.Constructor parameters in dev.nm.graph.community with type arguments of type UndirectedEdge Constructor Description EdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Computes the edge-betweeness-es of all edges in an undirected graph. -
Uses of UndirectedEdge in dev.nm.graph.type
Classes in dev.nm.graph.type with type parameters of type UndirectedEdge Modifier and Type Class Description class
SparseUnDiGraph<V,E extends UndirectedEdge<V>>
This class implements the sparse undirected graph representation.Classes in dev.nm.graph.type that implement UndirectedEdge Modifier and Type Class Description class
SimpleEdge<V>
A simple edge has two vertices.
-