Constant Field Values

Contents

• javautils.graph.*

javautils.graph.*

javautils.graph.templates.BfsTemplateTest

public static final java.lang.String	CLOTHING_GRAPH_BFS	"initNode(belt)\ninitNode(jacket)\ninitNode(pants)\ninitNode(shirt)\ninitNode(shoes)\ninitNode(socks)\ninitNode(tie)\ninitNode(undershorts)\ninitNode(watch)\ndiscoverRoot(belt) {\n*discoverNode(belt,0)\n-treeEdge(belt,jacket)\n*finishNode(belt,0)\n *discoverNode(jacket,1)\n *finishNode(jacket,1)\n} finishRoot(belt)\ndiscoverRoot(pants) {\n*discoverNode(pants,0)\n-treeEdge(pants,shoes)\n-nonTreeEdge(pants,belt)\n*finishNode(pants,0)\n *discoverNode(shoes,1)\n *finishNode(shoes,1)\n} finishRoot(pants)\ndiscoverRoot(shirt) {\n*discoverNode(shirt,0)\n-treeEdge(shirt,tie)\n-nonTreeEdge(shirt,belt)\n*finishNode(shirt,0)\n *discoverNode(tie,1)\n -nonTreeEdge(tie,jacket)\n *finishNode(tie,1)\n} finishRoot(shirt)\ndiscoverRoot(socks) {\n*discoverNode(socks,0)\n-nonTreeEdge(socks,shoes)\n*finishNode(socks,0)\n} finishRoot(socks)\ndiscoverRoot(undershorts) {\n*discoverNode(undershorts,0)\n-nonTreeEdge(undershorts,pants)\n-nonTreeEdge(undershorts,shoes)\n*finishNode(undershorts,0)\n} finishRoot(undershorts)\ndiscoverRoot(watch) {\n*discoverNode(watch,0)\n*finishNode(watch,0)\n} finishRoot(watch)\n"
public static final java.lang.String	RSTUVWXY_GRAPH_BFS	"initNode(s)\ninitNode(r)\ninitNode(t)\ninitNode(u)\ninitNode(v)\ninitNode(w)\ninitNode(x)\ninitNode(y)\ndiscoverRoot(s) {\n*discoverNode(s,0)\n-treeEdge(s,w)\n-treeEdge(s,r)\n*finishNode(s,0)\n *discoverNode(w,1)\n *discoverNode(r,1)\n -treeEdge(w,t)\n -treeEdge(w,x)\n -nonTreeEdge(w,s)\n *finishNode(w,1)\n -nonTreeEdge(r,s)\n -treeEdge(r,v)\n *finishNode(r,1)\n *discoverNode(t,2)\n *discoverNode(x,2)\n *discoverNode(v,2)\n -nonTreeEdge(t,x)\n -nonTreeEdge(t,w)\n -treeEdge(t,u)\n *finishNode(t,2)\n -nonTreeEdge(x,w)\n -nonTreeEdge(x,t)\n -nonTreeEdge(x,u)\n -treeEdge(x,y)\n *finishNode(x,2)\n -nonTreeEdge(v,r)\n *finishNode(v,2)\n *discoverNode(u,3)\n *discoverNode(y,3)\n -nonTreeEdge(u,t)\n -nonTreeEdge(u,x)\n -nonTreeEdge(u,y)\n *finishNode(u,3)\n -nonTreeEdge(y,u)\n -nonTreeEdge(y,x)\n *finishNode(y,3)\n} finishRoot(s)\n"

javautils.graph.templates.DfsTemplateTest

public static final java.lang.String	STUVWXYZ_GRAPH_DFS	"initNode(s)\ninitNode(t)\ninitNode(u)\ninitNode(v)\ninitNode(w)\ninitNode(x)\ninitNode(y)\ninitNode(z)\ndiscoverRoot(s) {\n discoverNode(s,1) {\n treeEdge(s,z)\n discoverNode(z,2) {\n treeEdge(z,y)\n discoverNode(y,3) {\n treeEdge(y,x)\n discoverNode(x,4) {\n backEdge(x,z)\n } finishNode(x,5)\n } finishNode(y,6)\n treeEdge(z,w)\n discoverNode(w,7) {\n crossEdge(w,x)\n } finishNode(w,8)\n } finishNode(z,9)\n forwardEdge(s,w)\n } finishNode(s,10)\n} finishRoot(s)\ndiscoverRoot(t) {\n discoverNode(t,11) {\n treeEdge(t,v)\n discoverNode(v,12) {\n crossEdge(v,s)\n crossEdge(v,w)\n } finishNode(v,13)\n treeEdge(t,u)\n discoverNode(u,14) {\n crossEdge(u,v)\n backEdge(u,t)\n } finishNode(u,15)\n } finishNode(t,16)\n} finishRoot(t)\n"
public static final java.lang.String	UVWXYZ_GRAPH_DFS	"initNode(u)\ninitNode(v)\ninitNode(w)\ninitNode(x)\ninitNode(y)\ninitNode(z)\ndiscoverRoot(u) {\n discoverNode(u,1) {\n treeEdge(u,v)\n discoverNode(v,2) {\n treeEdge(v,y)\n discoverNode(y,3) {\n treeEdge(y,x)\n discoverNode(x,4) {\n backEdge(x,v)\n } finishNode(x,5)\n } finishNode(y,6)\n } finishNode(v,7)\n forwardEdge(u,x)\n } finishNode(u,8)\n} finishRoot(u)\ndiscoverRoot(w) {\n discoverNode(w,9) {\n crossEdge(w,y)\n treeEdge(w,z)\n discoverNode(z,10) {\n backEdge(z,z)\n } finishNode(z,11)\n } finishNode(w,12)\n} finishRoot(w)\n"