|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Uses of UndirectedGraph in edu.uci.ics.jung.algorithms |
| Methods in edu.uci.ics.jung.algorithms with parameters of type UndirectedGraph | |
static cern.colt.matrix.DoubleMatrix2D |
GraphMatrixOperations.computeVoltagePotentialMatrix(UndirectedGraph graph)
The idea here is based on the metaphor of an electric circuit. |
| Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.importance |
| Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type UndirectedGraph | |
RandomWalkSTBetweenness(UndirectedGraph g,
Vertex s,
Vertex t)
Constructor which initializes the algorithm |
|
RandomWalkBetweenness(UndirectedGraph g)
Constructor which initializes the algorithm |
|
| Uses of UndirectedGraph in edu.uci.ics.jung.algorithms.transformation |
| Methods in edu.uci.ics.jung.algorithms.transformation that return UndirectedGraph | |
static UndirectedGraph |
DirectionTransformer.toUndirected(Graph dGraph)
Transforms graph (which may be either directed or mixed)
into an undirected graph without
parallel edges. |
| Uses of UndirectedGraph in edu.uci.ics.jung.graph.impl |
| Classes in edu.uci.ics.jung.graph.impl that implement UndirectedGraph | |
class |
BipartiteGraph
A Bipartite graph is divided into A vertices and B vertices. |
class |
UndirectedSparseGraph
An implementation of Graph that consists of a
Vertex set and an UndirectedEdge set.
|
| Uses of UndirectedGraph in edu.uci.ics.jung.statistics |
| Methods in edu.uci.ics.jung.statistics with parameters of type UndirectedGraph | |
static cern.colt.list.DoubleArrayList |
GraphStatistics.clusteringCoefficients(UndirectedGraph graph)
For each vertex, the net fraction of edges that actually exist in the neighborhood of distance 1 around each vertex vs all possible edges that could exist are computed The clustering coefficient measures the degree to which a node's neighbors are neighbors with each other Note: You can use cern.jet.stat.Descriptive to compute various statistics from the DoubleArrayList |
| Uses of UndirectedGraph in edu.uci.ics.jung.utils |
| Methods in edu.uci.ics.jung.utils that return UndirectedGraph | |
static UndirectedGraph |
GraphUtils.transform(DirectedGraph dGraph)
Deprecated. As of version 1.4, replaced by edu.ics.uci.jung.algorithms.transformation.DirectionTransformer#toUndirected(Graph) |
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||