public String toString(){
  StringBuilder buf=new StringBuilder();
  buf.append("\nIndexed connectivity:\n");
  for (int i=0; i < getNumFactors(); i++) {
    String factor=getFactor(i);
    buf.append("\n");
    buf.append(factor);
    buf.append("\t<-- ");
    for (int j=0; j < getNumParents(i); j++) {
      IndexedParent parent=getParent(i,j);
      buf.append("\t");
      buf.append(getFactor(parent.getIndex()));
      buf.append(":");
      buf.append(parent.getLag());
    }
  }
  buf.append("\n");
  return buf.toString();
}

public String toString ( ) { StringBuilder buf = new StringBuilder ( ) ; buf . append ( "\nIndexed connectivity:\n" ) ; for ( int i = 0 ; i < getNumFactors ( ) ; i ++ ) { String factor = getFactor ( i ) ; buf . append ( "\n" ) ; buf . append ( factor ) ; buf . append ( "\t<-- " ) ; for ( int j = 0 ; j < getNumParents ( i ) ; j ++ ) { IndexedParent parent = getParent ( i , j ) ; buf . append ( "\t" ) ; buf . append ( getFactor ( parent . getIndex ( ) ) ) ; buf . append ( ":" ) ; buf . append ( parent . getLag ( ) ) ; } } buf . append ( "\n" ) ; return buf . toString ( ) ; }
returns a string representation of the graph , indicating for each factor which lagged factors map into it .
