|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectedu.mit.sketch.chem.graph.Graph
public class Graph
| Field Summary | |
|---|---|
java.util.List<GraphEdge> |
edges
|
java.util.Queue<GraphVertex> |
queue
|
java.util.List<GraphVertex> |
vertices
|
| Constructor Summary | |
|---|---|
Graph()
|
|
| Method Summary | |
|---|---|
void |
addEdge(SketchComponent source)
Add an edge (bond) to the connectedness graph |
void |
addEdge(SketchComponent source,
GraphVertex v1,
GraphVertex v2)
Add a connected edge (bond) to the connectedness graph |
void |
addVertex(GraphVertex v)
Add a vertex (element or compound) to the connectedness graph |
java.util.List<StrokeGroup> |
causes(GraphVertex v)
|
void |
connectGraph(double threshold,
double bondLength)
|
void |
connectSpatial(double threshold)
|
boolean |
connectValence(double threshold)
|
boolean |
connectValenceImplicit(double threshold)
|
void |
createBenzene(java.util.List<GraphVertex> cycle)
|
java.util.List<GraphVertex> |
depthFirstSearch(GraphVertex target,
GraphVertex cur,
java.util.List<GraphVertex> history,
int mindepth,
int maxdepth)
|
java.util.List<GraphVertex> |
findCycle(GraphVertex v,
int maxdepth)
|
java.util.List<GraphVertex> |
findProblems()
|
void |
identifyBenzeneRings(double bondLength)
Find Benzene Rings |
void |
mergeVertices(GraphVertex v1,
GraphVertex v2)
|
void |
paint(java.awt.Graphics g)
Paint the connectedness graph |
void |
printGraph(java.lang.String filename)
|
double |
prob()
|
java.util.List<GraphVertex> |
refineCycle(java.util.List<GraphVertex> cycle)
|
void |
removeEdge(GraphEdge e)
|
void |
removeVertex(GraphVertex v)
|
void |
updateID()
|
void |
updateValence(boolean updateRecognition)
|
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public java.util.List<GraphVertex> vertices
public java.util.List<GraphEdge> edges
public java.util.Queue<GraphVertex> queue
| Constructor Detail |
|---|
public Graph()
| Method Detail |
|---|
public void paint(java.awt.Graphics g)
public void addVertex(GraphVertex v)
public void addEdge(SketchComponent source)
public void addEdge(SketchComponent source,
GraphVertex v1,
GraphVertex v2)
public void removeVertex(GraphVertex v)
public void removeEdge(GraphEdge e)
public void connectGraph(double threshold,
double bondLength)
public boolean connectValence(double threshold)
public boolean connectValenceImplicit(double threshold)
public double prob()
public void connectSpatial(double threshold)
public void updateValence(boolean updateRecognition)
public java.util.List<GraphVertex> findProblems()
public java.util.List<StrokeGroup> causes(GraphVertex v)
public void mergeVertices(GraphVertex v1,
GraphVertex v2)
public void updateID()
public void identifyBenzeneRings(double bondLength)
public void createBenzene(java.util.List<GraphVertex> cycle)
public java.util.List<GraphVertex> findCycle(GraphVertex v,
int maxdepth)
public java.util.List<GraphVertex> depthFirstSearch(GraphVertex target,
GraphVertex cur,
java.util.List<GraphVertex> history,
int mindepth,
int maxdepth)
public java.util.List<GraphVertex> refineCycle(java.util.List<GraphVertex> cycle)
public void printGraph(java.lang.String filename)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||