| 
     
      
      
      From: Phil S. <p.s...@gn...> - 2005-03-15 21:40:41
      
     
   | 
Okay, will do, but not immediately. Oh and yet another one. Components are heirachical. Ie a node might internally consist of a collection of nodes (which in turn can be made of smaller nodes). So aggregation and hiding are added bits. For planar graphs, you can manage this very easily by maintaining an incidence matrix. This allows you quickly calculate link to a supernode from the subnode links. ---------------------------------------------------------- Phil Scadden, Institute of Geological and Nuclear Sciences 764 Cumberland St, Private Bag 1930, Dunedin, New Zealand Ph +64 3 4799663, fax +64 3 477 5232  |