public void action(GraphData graphData) {
toInsert.clear();
GraphModel g = graphData.getGraph();
AlgorithmUtils.clearVertexMarks(g);
for (Vertex v : g) {
subtree.clear();
aStar(v, v, k, g);
for (Vertex vv : subtree) vv.setMark(false);
}
g.insertEdges(toInsert);
}
void aStar(Vertex root, Vertex v, int k, GraphModel g) {
if (k == 0) return;
v.setMark(true);
subtree.add(v);
for (Vertex vv : g.getNeighbors(v)) {
if (!vv.getMark()) {
toInsert.add(new Edge(root, vv));
aStar(root, vv, k - 1, g);
}
}
}
@Override
public void doAlgorithm() {
step("TEST the step");
GraphModel g = graphData.getGraph();
Vertex v1 = requestVertex(g, "select the first vertex");
Vertex v2 = requestVertex(g, "select the second vertex");
step("color v1 and v2");
v1.setColor(2);
v2.setColor(2);
step("mark v1 neighbours");
for (Vertex v : g.neighbors(v1)) v.setMark(true);
step("color v1 edges");
for (Edge e : g.edges(v1)) e.setColor(3);
step("connect v2 to the neighbors of its neighbours");
Vector<Edge> toInsert = new Vector<Edge>();
for (Vertex v : g.neighbors(v2))
for (Vertex vv : g.neighbors(v)) toInsert.add(new Edge(v2, vv));
g.insertEdges(toInsert);
step("mark the path connecting v1 and v2, using helper methods in AlgorithmUtils");
Path<Vertex> path = AlgorithmUtils.getPath(g, v1, v2);
Vertex last = v2;
for (Vertex v : path) {
Edge e = g.getEdge(v, last);
if (e != null) e.setColor(6);
last = v;
}
step("the graph matrix<br>" + getMatrixHTML(g));
step("That's it!");
step("Start making your algorithm by modifing this file, and running make.sh");
step("have fun :)");
}
