V
- vertex typepublic class EdgeBetweeness<V> extends Object
Constructor and Description |
---|
EdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
Computes the edge-betweeness-es of all edges in an undirected graph.
|
Modifier and Type | Method and Description |
---|---|
boolean |
contains(UndirectedEdge<V> edge)
Checks if the graph contains an edge.
|
Set<UndirectedEdge<V>> |
edges()
Gets the set of all edges in the graph.
|
boolean |
isEmpty()
Checks if there is no edge, e.g., all vertices are isolated.
|
UndirectedEdge<V> |
maxEdge()
Gets the edge with the maximal edge-betweeness.
|
double |
maxValue()
Gets the maximum of edge-betweeness-es.
|
String |
toString() |
double |
value(UndirectedEdge<V> edge)
Gets the edge-betweeness of an edge.
|
public EdgeBetweeness(UnDiGraph<V,? extends UndirectedEdge<V>> g)
g
- an undirected graphpublic boolean contains(UndirectedEdge<V> edge)
edge
- an edgetrue
if the graph contains an edgepublic double value(UndirectedEdge<V> edge)
edge
- an edgepublic Set<UndirectedEdge<V>> edges()
public UndirectedEdge<V> maxEdge()
null
if no edge in the clusterpublic double maxValue()
public boolean isEmpty()
true
if there is no edgeCopyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.