public final void walkGraph(Hashtable semNodesTable){
  Integer uid=new Integer(myUID);
  if (semNodesTable.get(uid) != null)   return;
  semNodesTable.put(new Integer(myUID),this);
}

public final void walkGraph ( Hashtable semNodesTable ) { Integer uid = new Integer ( myUID ) ; if ( semNodesTable . get ( uid ) != null ) return ; semNodesTable . put ( new Integer ( myUID ) , this ) ; }
walkgraph finds all reachable nodes in the semantic graph and inserts them in the hashtable semnodestable for use by the explorer tool .
