public String toString(){
  StringBuilder buf=new StringBuilder();
  buf.append("\nUpdate graph:\n");
  Collection<String> factors=connectivity.keySet();
  for (  String factor : factors) {
    buf.append("\n");
    buf.append(factor);
    buf.append("\t<-- ");
    Collection<LaggedFactor> edges=connectivity.get(factor);
    for (    LaggedFactor edge : edges) {
      buf.append("\t");
      buf.append(edge);
    }
  }
  buf.append("\n");
  return buf.toString();
}

public String toString ( ) { StringBuilder buf = new StringBuilder ( ) ; buf . append ( "\nUpdate graph:\n" ) ; Collection < String > factors = connectivity . keySet ( ) ; for ( String factor : factors ) { buf . append ( "\n" ) ; buf . append ( factor ) ; buf . append ( "\t<-- " ) ; Collection < LaggedFactor > edges = connectivity . get ( factor ) ; for ( LaggedFactor edge : edges ) { buf . append ( "\t" ) ; buf . append ( edge ) ; } } buf . append ( "\n" ) ; return buf . toString ( ) ; }
returns a string representation of the graph , indicating for each factor which lagged factors map into it .
