@Override public String toString() { StringBuilder sb = new StringBuilder(); depthFirstSearch(true, sb); return sb.toString(); }
/** * For testing only. */ public static void main(String[] args) { List pathList = new ArrayList(); TransducerGraph graph = createRandomGraph(1000, 10, 0.0, 10, pathList); System.out.println("Done creating random graph"); printPathOutputs(pathList, graph, true); System.out.println("Depth first search from start node"); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); b = new StringBuilder(); System.out.println("Depth first search back from end node"); graph.depthFirstSearch(false, b); System.out.println(b.toString()); }
public static void main(String[] args) { TransducerGraph.GraphProcessor qd = new QuasiDeterminizer(); List pathList = new ArrayList(); TransducerGraph graph = TransducerGraph.createRandomGraph(1000, 10, 1.0, 10, pathList); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); System.out.println("Done creating random graph"); // TransducerGraph.printPathOutputs(pathList, graph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(graph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph newGraph = qd.processGraph(graph); System.out.println("Done quasi-determinizing"); //TransducerGraph.printPathOutputs(pathList, newGraph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(newGraph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph.testGraphPaths(graph, newGraph, 1000); }
@Override public String toString() { StringBuilder sb = new StringBuilder(); depthFirstSearch(true, sb); return sb.toString(); }
@Override public String toString() { StringBuilder sb = new StringBuilder(); depthFirstSearch(true, sb); return sb.toString(); }
@Override public String toString() { StringBuilder sb = new StringBuilder(); depthFirstSearch(true, sb); return sb.toString(); }
@Override public String toString() { StringBuffer sb = new StringBuffer(); depthFirstSearch(true, sb); return sb.toString(); }
/** * For testing only. */ public static void main(String[] args) { List pathList = new ArrayList(); TransducerGraph graph = createRandomGraph(1000, 10, 0.0, 10, pathList); System.out.println("Done creating random graph"); printPathOutputs(pathList, graph, true); System.out.println("Depth first search from start node"); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); b = new StringBuilder(); System.out.println("Depth first search back from end node"); graph.depthFirstSearch(false, b); System.out.println(b.toString()); }
/** * For testing only. */ public static void main(String[] args) { List pathList = new ArrayList(); TransducerGraph graph = createRandomGraph(1000, 10, 0.0, 10, pathList); System.out.println("Done creating random graph"); printPathOutputs(pathList, graph, true); System.out.println("Depth first search from start node"); StringBuffer b = new StringBuffer(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); b = new StringBuffer(); System.out.println("Depth first search back from end node"); graph.depthFirstSearch(false, b); System.out.println(b.toString()); }
/** * For testing only. */ public static void main(String[] args) { List pathList = new ArrayList(); TransducerGraph graph = createRandomGraph(1000, 10, 0.0, 10, pathList); System.out.println("Done creating random graph"); printPathOutputs(pathList, graph, true); System.out.println("Depth first search from start node"); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); b = new StringBuilder(); System.out.println("Depth first search back from end node"); graph.depthFirstSearch(false, b); System.out.println(b.toString()); }
/** * For testing only. */ public static void main(String[] args) { List pathList = new ArrayList(); TransducerGraph graph = createRandomGraph(1000, 10, 0.0, 10, pathList); System.out.println("Done creating random graph"); printPathOutputs(pathList, graph, true); System.out.println("Depth first search from start node"); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); b = new StringBuilder(); System.out.println("Depth first search back from end node"); graph.depthFirstSearch(false, b); System.out.println(b.toString()); }
public static void main(String[] args) { TransducerGraph.GraphProcessor qd = new QuasiDeterminizer(); List pathList = new ArrayList(); TransducerGraph graph = TransducerGraph.createRandomGraph(1000, 10, 1.0, 10, pathList); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); System.out.println("Done creating random graph"); // TransducerGraph.printPathOutputs(pathList, graph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(graph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph newGraph = qd.processGraph(graph); System.out.println("Done quasi-determinizing"); //TransducerGraph.printPathOutputs(pathList, newGraph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(newGraph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph.testGraphPaths(graph, newGraph, 1000); }
public static void main(String[] args) { TransducerGraph.GraphProcessor qd = new QuasiDeterminizer(); List pathList = new ArrayList(); TransducerGraph graph = TransducerGraph.createRandomGraph(1000, 10, 1.0, 10, pathList); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); System.out.println("Done creating random graph"); // TransducerGraph.printPathOutputs(pathList, graph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(graph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph newGraph = qd.processGraph(graph); System.out.println("Done quasi-determinizing"); //TransducerGraph.printPathOutputs(pathList, newGraph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(newGraph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph.testGraphPaths(graph, newGraph, 1000); }
public static void main(String[] args) { TransducerGraph.GraphProcessor qd = new QuasiDeterminizer(); List pathList = new ArrayList(); TransducerGraph graph = TransducerGraph.createRandomGraph(1000, 10, 1.0, 10, pathList); StringBuilder b = new StringBuilder(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); System.out.println("Done creating random graph"); // TransducerGraph.printPathOutputs(pathList, graph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(graph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph newGraph = qd.processGraph(graph); System.out.println("Done quasi-determinizing"); //TransducerGraph.printPathOutputs(pathList, newGraph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(newGraph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph.testGraphPaths(graph, newGraph, 1000); }
public static void main(String[] args) { TransducerGraph.GraphProcessor qd = new QuasiDeterminizer(); List pathList = new ArrayList(); TransducerGraph graph = TransducerGraph.createRandomGraph(1000, 10, 1.0, 10, pathList); StringBuffer b = new StringBuffer(); graph.depthFirstSearch(true, b); System.out.println(b.toString()); System.out.println("Done creating random graph"); // TransducerGraph.printPathOutputs(pathList, graph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(graph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph newGraph = qd.processGraph(graph); System.out.println("Done quasi-determinizing"); //TransducerGraph.printPathOutputs(pathList, newGraph, false); //System.out.println("Depth first search from start node"); //TransducerGraph.depthFirstSearch(newGraph, TransducerGraph.END_NODE, new HashSet(), 0, false); TransducerGraph.testGraphPaths(graph, newGraph, 1000); }