Modifier and Type | Method and Description |
---|---|
Node |
ProcessDiagram.findNode(java.lang.String nodeName)
Looks for a node with the given node name in the table (ArrayList of nodes)
|
Node |
Edge.getConnector(Node node)
Given one of the nodes contained in this edge, returns the OTHER node
|
Node |
Edge.getEndNode()
Gets the end node
|
Node |
Edge.getStartNode()
Gets the starter node
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Node> |
ProcessGraph.copyNodeList(java.util.ArrayList<Node> list)
Recieves an arraylist and produces a new copy of it
|
java.util.ArrayList<Node> |
ProcessGraph.getCluster(Node homeNode)
Returns all the nodes reachable from this node
by traversing the nodes edges
|
java.util.ArrayList<Node> |
ProcessGraph.getCluster2(Node homeNode,
java.util.ArrayList<Node> cluster)
Returns all the nodes reachable from this node
by traversing the nodes edges
|
java.util.ArrayList<Node> |
ProcessDiagram.process(java.lang.String fileName)
Opens an ACCESS diagram text file, reads and processes the text file
and stores the entities and there relationships
|
java.util.ArrayList<java.util.ArrayList<Node>> |
ProcessGraph.processCuts(java.util.ArrayList<Node> cluster,
java.util.ArrayList<java.util.ArrayList<Node>> clusters)
Process the mincuts and combine them in various ways
to find the clusters in the diagram.
|
java.util.ArrayList<java.util.ArrayList<Node>> |
ProcessGraph.runSystem() |
java.util.ArrayList<Node> |
Util.splitEntityNames(java.util.ArrayList<Node> nodes)
Given a list of nodes iterates through the list and renames
nodes (ex: MyClass --> My Class
HTML --> HTML
PDFLoader --> PDF Loader
|
Modifier and Type | Method and Description |
---|---|
void |
Node.addNode(Node node)
Create an edge between me and another node
(if it doesnt already exist)
let that node know there is an edge to me
|
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
|
boolean |
ProcessGraph.areDisconnected(Node homeNode,
Node destNode)
Tests if there is a way to traverse edges so that we reach node2 from node1
|
boolean |
ProcessGraph.areDisconnected2(Node homeNode,
Node destNode)
Tests if there is a way to traverse edges so that we reach node2 from node1
|
int |
ProcessGraph.clusterSize(Node homeNode)
Counts the number of nodes reachable from the input node
by traversing the nodes edges
|
int |
ProcessGraph.clusterSize2(Node homeNode)
Counts the number of nodes reachable from the input node
by traversing the nodes edges
|
java.util.ArrayList<Node> |
ProcessGraph.getCluster(Node homeNode)
Returns all the nodes reachable from this node
by traversing the nodes edges
|
java.util.ArrayList<Node> |
ProcessGraph.getCluster2(Node homeNode,
java.util.ArrayList<Node> cluster)
Returns all the nodes reachable from this node
by traversing the nodes edges
|
Node |
Edge.getConnector(Node node)
Given one of the nodes contained in this edge, returns the OTHER node
|
boolean |
ProcessGraph.hasAdditionalCuts(Node homeNode,
java.util.ArrayList<EdgeList> mincuts,
EdgeList thisCut)
Checks if there are additional cuts reachable from this node
by traversing the nodes edges
|
boolean |
ProcessGraph.hasAdditionalCuts2(Node homeNode,
java.util.ArrayList<EdgeList> mincuts,
EdgeList thisCut)
Checks if there are additional cuts reachable from this node
by traversing the nodes edges
|
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
|
void |
Node.removeEdge(Node node)
Remove edge between me and entity node
|
void |
Edge.setEndNode(Node endNode)
Sets the end node
|
void |
Edge.setStartNode(Node startNode)
Sets the started node
|
Modifier and Type | Method and Description |
---|---|
java.util.ArrayList<Node> |
ProcessGraph.copyNodeList(java.util.ArrayList<Node> list)
Recieves an arraylist and produces a new copy of it
|
java.util.ArrayList<EdgeList> |
ProcessGraph.findMinCuts(java.util.ArrayList<Node> tables)
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
|
float |
Util.getAvgDistance(java.util.ArrayList<Node> nodes)
Given a list of nodes, looks at all names and rates
the distance of words in the list
(rating is from [0,1])
looks at pairwise distances between names, and keeps lowest pairwise
distance, adds them up and divides by total
|
java.util.ArrayList<Node> |
ProcessGraph.getCluster2(Node homeNode,
java.util.ArrayList<Node> cluster)
Returns all the nodes reachable from this node
by traversing the nodes edges
|
boolean |
ProcessGraph.processCluster(java.util.ArrayList<Node> cluster)
Uses wordNet to evaluate if a cluster has sufficient inter-similiarity
|
java.util.ArrayList<java.util.ArrayList<Node>> |
ProcessGraph.processCuts(java.util.ArrayList<Node> cluster,
java.util.ArrayList<java.util.ArrayList<Node>> clusters)
Process the mincuts and combine them in various ways
to find the clusters in the diagram.
|
java.util.ArrayList<java.util.ArrayList<Node>> |
ProcessGraph.processCuts(java.util.ArrayList<Node> cluster,
java.util.ArrayList<java.util.ArrayList<Node>> clusters)
Process the mincuts and combine them in various ways
to find the clusters in the diagram.
|
java.util.ArrayList<Node> |
Util.splitEntityNames(java.util.ArrayList<Node> nodes)
Given a list of nodes iterates through the list and renames
nodes (ex: MyClass --> My Class
HTML --> HTML
PDFLoader --> PDF Loader
|
Constructor and Description |
---|
Edge(Node startNode,
Node endNode) |
EdgeList(Node head) |
EdgeList(Node head,
java.util.ArrayList<Edge> edgeList) |