|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
public class ExactFlowCommunity
ExactFlowCommunity is an algorithm that uses a set of root nodes that are supposed to be representative of a community to find the entire community using principles based on max-flow/min-cut.
Constructor Summary | |
---|---|
ExactFlowCommunity(int cohesionThreshold)
Constructs and initializes the algorithm |
Method Summary | |
---|---|
Set |
extract(DirectedGraph graph,
Set rootSet)
Extracts the community according to the cohesion threshold |
static Set |
extract(DirectedGraph graph,
Set rootSet,
int numIterations)
Implements the "ApproximateFlowCommunity" algorithm. |
protected void |
initializeFlowGraph(DirectedGraph flowGraph,
Vertex source,
Vertex sink,
Set rootSet)
Initialize the flow graph |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ExactFlowCommunity(int cohesionThreshold)
cohesionThreshold
- a heuristic value that determines the
level of cohesion for the community to be extractedMethod Detail |
---|
public Set extract(DirectedGraph graph, Set rootSet)
graph
- the original graphrootSet
- the set of nodes used to see the community
public static Set extract(DirectedGraph graph, Set rootSet, int numIterations)
graph
- the original graphrootSet
- the set of nodes used to see the community
protected void initializeFlowGraph(DirectedGraph flowGraph, Vertex source, Vertex sink, Set rootSet)
flowGraph
- the flow graphsource
- the source nodesink
- the sink noderootSet
- the set of nodes used to seed the community
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |