A C D E F G H I L M N P R S U 

F

findMinCuts(ArrayList<Node>) - Method in class ProcessGraph
Identifies the sets of edges that represent min cuts in the diagram PSEUDOCODE: Iterate over all nodes Find all edge combinations for each node For each combination: Remove these edges from the graph Ensure all subset nodes are in the SAME cluster Test for a relation between the original node and the nodes in the subset Ensure that the cluster meets various conditions Restore the edges
findNode(String) - Method in class ProcessDiagram
Looks for a node with the given node name in the table (ArrayList of nodes)
A C D E F G H I L M N P R S U