public Tree readFile(Tree tree){ int key=0; while(x.hasNext()){ String patientName = x.next(); String doctorName = x.next(); String currentApp = x.next(); String nextApp = x.next(); tree.addNode(key++, patientName, doctorName, currentApp, nextApp); } }
private void addSubtree (Object parent, Tree subtree, Object child) { addNode (parent, child); for (Iterator it = subtree.getChildren (child).iterator (); it.hasNext ();) { Object gchild = it.next (); addSubtree (child, subtree, gchild); } }
private void addSubtree (Object parent, Tree subtree, Object child) { addNode (parent, child); for (Iterator it = subtree.getChildren (child).iterator (); it.hasNext ();) { Object gchild = it.next (); addSubtree (child, subtree, gchild); } }
private void addSubtree (Object parent, Tree subtree, Object child) { addNode (parent, child); for (Iterator it = subtree.getChildren (child).iterator (); it.hasNext ();) { Object gchild = it.next (); addSubtree (child, subtree, gchild); } }
private static cc.mallet.grmm.types.Tree graphToTree (Graph g) throws Exception { // Perhaps handle gracefully?? -cas if (g.vertexSet ().size () <= 0) { throw new RuntimeException ("Empty graph."); } Tree tree = new cc.mallet.grmm.types.Tree (); Object root = g.vertexSet ().iterator ().next (); tree.add (root); for (Iterator it1 = new BreadthFirstIterator (g, root); it1.hasNext();) { Object v1 = it1.next (); for (Iterator it2 = g.edgesOf (v1).iterator (); it2.hasNext ();) { Edge edge = (Edge) it2.next (); Object v2 = edge.oppositeVertex (v1); if (tree.getParent (v1) != v2) { tree.addNode (v1, v2); assert tree.getParent (v2) == v1; } } } return tree; }
private static cc.mallet.grmm.types.Tree graphToTree (Graph g) throws Exception { // Perhaps handle gracefully?? -cas if (g.vertexSet ().size () <= 0) { throw new RuntimeException ("Empty graph."); } Tree tree = new cc.mallet.grmm.types.Tree (); Object root = g.vertexSet ().iterator ().next (); tree.add (root); for (Iterator it1 = new BreadthFirstIterator (g, root); it1.hasNext();) { Object v1 = it1.next (); for (Iterator it2 = g.edgesOf (v1).iterator (); it2.hasNext ();) { Edge edge = (Edge) it2.next (); Object v2 = edge.oppositeVertex (v1); if (tree.getParent (v1) != v2) { tree.addNode (v1, v2); assert tree.getParent (v2) == v1; } } } return tree; }
private static cc.mallet.grmm.types.Tree graphToTree (Graph g) throws Exception { // Perhaps handle gracefully?? -cas if (g.vertexSet ().size () <= 0) { throw new RuntimeException ("Empty graph."); } Tree tree = new cc.mallet.grmm.types.Tree (); Object root = g.vertexSet ().iterator ().next (); tree.add (root); for (Iterator it1 = new BreadthFirstIterator (g, root); it1.hasNext();) { Object v1 = it1.next (); for (Iterator it2 = g.edgesOf (v1).iterator (); it2.hasNext ();) { Edge edge = (Edge) it2.next (); Object v2 = edge.oppositeVertex (v1); if (tree.getParent (v1) != v2) { tree.addNode (v1, v2); assert tree.getParent (v2) == v1; } } } return tree; }
public void addNode (Object parent1, Object child1) { super.addNode(parent1, child1); VarSet parent = (VarSet) parent1; VarSet child = (VarSet) child1; Set sepset = parent.intersection(child); int id1 = lookupIndex(parent); int id2 = lookupIndex(child); putSepset(id1, id2, new Sepset (sepset, newSepsetPtl (sepset))); }
public void addNode (Object parent1, Object child1) { super.addNode(parent1, child1); VarSet parent = (VarSet) parent1; VarSet child = (VarSet) child1; Set sepset = parent.intersection(child); int id1 = lookupIndex(parent); int id2 = lookupIndex(child); putSepset(id1, id2, new Sepset (sepset, newSepsetPtl (sepset))); }
public void addNode (Object parent1, Object child1) { super.addNode(parent1, child1); VarSet parent = (VarSet) parent1; VarSet child = (VarSet) child1; Set sepset = parent.intersection(child); int id1 = lookupIndex(parent); int id2 = lookupIndex(child); putSepset(id1, id2, new Sepset (sepset, newSepsetPtl (sepset))); }