Index: src/dgp/dgp1.cc
===================================================================
--- src/dgp/dgp1.cc	(revision 3b02b04ff9c7c3446ca477cd84c2bc7f737c38b4)
+++ src/dgp/dgp1.cc	(revision b97a55609b527df1f92edbe0c70d03a6385c0132)
@@ -173,5 +173,5 @@
   
   if(debug) sgraph.print_node_debug(stderr,"C ",newheadind,h);
-  if(debug) print_sets(newheadind);
+  // if(debug) print_sets(newheadind);
   return newheadind;
 }
@@ -192,5 +192,5 @@
   
   if(debug) sgraph.print_node_debug(stderr,"C ",newind,d);
-  if(debug) print_sets(newind);
+  // if(debug) print_sets(newind);
   
   return newind;
@@ -212,5 +212,5 @@
 
   if(debug) sgraph.print_node_debug(stderr,"C ",newheadind,h);
-  if(debug) print_sets(newheadind);
+  // if(debug) print_sets(newheadind);
   
   return newheadind;
@@ -230,5 +230,5 @@
 
   if(debug) sgraph.print_node_debug(stderr,"C ",newind,d);
-  if(debug) print_sets(newind);
+  // if(debug) print_sets(newind);
   
   return newind;
@@ -304,7 +304,7 @@
   if(debug) sgraph.print_arc(stderr,newheadind,d,l.role,0);
   if(debug) sgraph.print_node_debug(stderr,"U ",newheadind,h);
-  if(debug) print_sets(newheadind);
+  // if(debug) print_sets(newheadind);
   if(debug) sgraph.print_node_debug(stderr,"U ",newdepind,d);
-  if(debug) print_sets(newdepind);
+  // if(debug) print_sets(newdepind);
 }
 
Index: src/dgp/sgraph.cc
===================================================================
--- src/dgp/sgraph.cc	(revision 3b02b04ff9c7c3446ca477cd84c2bc7f737c38b4)
+++ src/dgp/sgraph.cc	(revision b97a55609b527df1f92edbe0c70d03a6385c0132)
@@ -113,6 +113,8 @@
     for(vector<Arc>::iterator h=node.heads.begin(); h!=node.heads.end(); ++h)
     {
-      if(cont) buf+=sprintf(buf,","); else cont=true;
-      buf+=sprintf(buf,"++%s-%d(%d~%d)",h->role.str(),h->dst,h->headanc,h->depanc);
+      // if(cont) buf+=sprintf(buf,","); else cont=true;
+      buf+=sprintf(buf,"(++%s:%d)",h->role.str(),h->dst);
+      // buf+=sprintf(buf,"++%s-%d(%d~%d)",h->role.str(),h->dst,h->headanc,h->depanc);
+      // buf+=sprintf(buf,"(<-%s-%d)",h->role.str(),h->dst);
     }
 
@@ -121,6 +123,8 @@
     {
       //      if(! nodes[d->dst].saturated()) continue; // NIE DRUKUJ NIENASYCONYCH PODRZEDNIKOW
-      if(cont) buf+=sprintf(buf,","); else cont=true;
-      buf+=sprintf(buf,"--%s-%d(%d~%d)",d->role.str(),d->dst,d->headanc,d->depanc);
+      // if(cont) buf+=sprintf(buf,","); else cont=true;
+      buf+=sprintf(buf,"(--%s:%d)",d->role.str(),d->dst);
+      // buf+=sprintf(buf,"--%s-%d(%d~%d)",d->role.str(),d->dst,d->headanc,d->depanc);
+      // buf+=sprintf(buf,"(-%s->%d)",d->role.str(),d->dst);
     }
   
Index: src/rm12/rm12
===================================================================
--- src/rm12/rm12	(revision 5f4d9c3b32eea7b6643a751aa75bdb05b7d41576)
+++ src/rm12/rm12	(revision b97a55609b527df1f92edbe0c70d03a6385c0132)
Index: src/tre/tre
===================================================================
--- src/tre/tre	(revision 3b02b04ff9c7c3446ca477cd84c2bc7f737c38b4)
+++ src/tre/tre	(revision b97a55609b527df1f92edbe0c70d03a6385c0132)
@@ -21,5 +21,5 @@
 $helptext=
 "The program generates trees from the graph output by dgp. dgp must\n"+
-"must be run with '-i ds' option.\n\n"+
+"must be run with '--info=ds' option.\n\n"+
 "Command:       tre [options]\n\n"+
 "Options:\n"+
@@ -269,5 +269,5 @@
 
     if parts[3]==nil || parts[4]==nil || parts[5]==nil
-      $stderr.print "ERR: tre requires dgp be called with '--info s' option. Aborting.\n"
+      $stderr.print "ERR: tre requires dgp be called with '--info=ds' option. Aborting.\n"
       exit
     end
@@ -280,7 +280,9 @@
     $arcs |= parts[2].split(',').map{ |a| case a 
                                           when /\-\-(\w+)-(\d+)\((\d+)~(\d+)\)/
-                                            [i, $2.to_i, $1, $3.to_i, $4.to_i]
+                                            # [i, $2.to_i, $1, $3.to_i, $4.to_i]
+                                            [i, $2.to_i, $1, 0, 0]
                                           when /\+\+(\w+)-(\d+)\((\d+)~(\d+)\)/
-                                            [$2.to_i, i, $1, $3.to_i, $4.to_i]
+                                            # [$2.to_i, i, $1, $3.to_i, $4.to_i]
+                                            [$2.to_i, i, $1, 0, 0]
                                           end }
     $succ |= parts[3][1..-2].split(',').map{|x| [x.to_i,i]}