From: jotel99@hotmail.com   
      
   hi markus, hi tapio,   
      
   Markus Humm typed:   
   > Tapio Marjomäki schrieb:   
   >> Hi,   
   >>   
   >> anyone has an idea to handle large very sparse matrices, let's say   
   >> 1M x 1M?   
   >>   
   >> Tapio   
   >>   
   >>   
   > Mh, under DOS? Linked list with arrays, e.g. one row of the matrix is   
   > one entry in the linked list...   
      
   huh?   
   still much too big, i think.   
      
   Why not use a tree structure or some hashing.   
      
   But of course accesses to read and set values on the matrices will look   
   different then.   
   If there are too many entries in the matrices u will run out of memeory   
   anyway - dpmi or not.   
      
   A single entry will need more space of course.   
      
   Something like this:   
      
   tEntry = record x,y longint; d: double end;   
   + space for the pointers and/or unused space in hash or a combination of   
   both.   
      
   Under plain DOS it should be really sparse then :)   
      
   hth   
   Jochen   
      
   --   
   http://radio789.net.ms - Radio 789 - We play it ALL   
   Radiostream: http://stream789.net.ms   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)