transform.c

#include<LEDA/graph.h>
#include<LEDA/tuple.h>
#include<LEDA/stream.h>
#include<LEDA/string.h>
#include<fstream.h>
#include<iostream.h>

#define MULT 2
#define BIG_M 300000

using namespace LEDA;

typedef two_tuple<node, node> prec;

LEDA::string read_next_line(istream& is) {
  LEDA::string s="#";
  while((!is.eof()) && ((s.head(1)=="#") || (s.length()==0) || (s.head(1)==" "))) {
    s.read_line(is);
  };
  if(is.eof()) s="";
  return s;
};


int main(int argc, char** argv) {

  // READ_GRAPH

  ifstream is(argv[1]);

  GRAPH<int,int> G;

  LEDA::string_istream si(read_next_line(is));
  int n,i,j,k,l;

  si>>n;
  LEDA::string Names[n];

  //cout<<n<<" nodes in the graph\n";

  int M[n*n+n+1][n*n+n+1];

  list<int> L[n];
  int SUCC[n*n+n];

  for(int i=0; i<=n*n+n; i++) {
    for(int j=0; j<=n*n+n; j++) {
      M[i][j]=100000000;
    };
  };

  for(int i=0; i<n*n; i++) 
    L[i/n].append(i);

  for(int i=0; i<n; i++) {
    L[i].append(n*n+i);
  }

  list_item li;
  for(int i=0; i<n; i++) {
    forall_items(li, L[i]) {
      M[L[i][li]][L[i][L[i].cyclic_succ(li)]]=0;
      M[L[i][li]][n*n+n]=0;
      SUCC[L[i][li]]=L[i][L[i].cyclic_succ(li)];
    }
  }

  for(int i=0; i<n; i++) {
    M[n*n+n][SUCC[n*n+i]]=0;
  }

  for(int i=0; i<n; i++) Names[i]=read_next_line(is);

  while(!is.eof()) {
    string_istream si(read_next_line(is));
    si>>i;
    if(!si.eof()) {
      si>>j; si>>k; 
      leda_string ls;
      char ch;
      ls.read_line(si);
      l=0;
      bool neg=false;
      for(int in=0; in<ls.length(); in++) {
        ch=ls[in];
        if(ch=='-') neg=true;
        if(ch==',') l*=MULT;
        if(ch=='0') l=10*l  ;
        if(ch=='1') l=10*l+1;
        if(ch=='2') l=10*l+2;
        if(ch=='3') l=10*l+3;
        if(ch=='4') l=10*l+4;
        if(ch=='5') l=10*l+5;
        if(ch=='6') l=10*l+6;
        if(ch=='7') l=10*l+7;
        if(ch=='8') l=10*l+8;
        if(ch=='9') l=10*l+9;
      }     
      if(neg) l=-l;
      if(i!=-1) {
        M[j*n+i][SUCC[k*n+j]]=l+BIG_M;
      } else {
        M[n*n+j][SUCC[k*n+j]]=l+BIG_M;
      }
    }
  };

  // END_READ_GRAPH


  cout<<n*n+n+1<<endl;
  //for(int i=0; i<n*n+1; i++) cout<<"bla\n";
  
  for(int i=0; i<=n*n+n; i++) {
    for(int j=0; j<=n*n+n; j++) {
      cout<<M[i][j]<<" ";
      if(j%10==9) cout<<endl;
      //if(M[i][j]<1000000) cout<<i<<" "<<j<<" "<<M[i][j]<<endl;
    }
    cout<<endl;
  }
  cout<<endl;

 
};

---