Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<java.util.ArrayList<Edge>> |
ProcessGraph.allNodeSubsets(Node node)
Receieves a node which includes its edges
and finds ALL possible ways to combine the edges
i.e if we have node 'A' with edges 1,2,3
it will return 1,2,3,1 2, 1 3, 2 3, 1 2 3
|
java.util.ArrayList<Edge> |
ProcessGraph.copyList(java.util.ArrayList<Edge> list)
Recieves an arraylist and produces a new copy of it
|
Modifier and Type | Method and Description |
---|---|
boolean |
Edge.compare(Edge edge)
Compares two edges to test if they contain the same nodes
|
boolean |
ProcessGraph.isInMinCuts(Edge edge,
java.util.ArrayList<EdgeList> mincuts,
EdgeList thisCut)
Checks if a given edge is contained in the list of mincuts.
|
boolean |
ProcessGraph.removeEdge(Edge compareEdge,
java.util.ArrayList<Edge> edgeList)
Attempts to remove an edge from an edgeList
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Edge> |
ProcessGraph.copyList(java.util.ArrayList<Edge> list)
Recieves an arraylist and produces a new copy of it
|
boolean |
ProcessGraph.isMincut(java.util.ArrayList<EdgeList> minCuts,
java.util.ArrayList<Edge> mincut,
Node node)
Verifies that the candidate mincut satisfies the conditions that make it a mincut
Improvement is left for future works
param minCuts The current list of approved minCuts
param mincut The candidate mincut
param node The node we are testing to see if it has a mincut
|
boolean |
ProcessGraph.removeEdge(Edge compareEdge,
java.util.ArrayList<Edge> edgeList)
Attempts to remove an edge from an edgeList
|
Constructor and Description |
---|
EdgeList(Node head,
java.util.ArrayList<Edge> edgeList) |