COIN-OR::LEMON - Graph Library

Changes between Initial Version and Version 1 of Ticket #3


Ignore:
Timestamp:
01/23/08 00:12:13 (12 years ago)
Author:
Peter Kovacs
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #3 – Description

    initial v1  
    1 Counting the number of edges and nodes is a frequent graph operation. Now, it takes linear time to get these values. Instead we might store these values and update the at every edge/node addition and deletion.
     1Counting the number of edges and nodes is a frequent graph operation. Now, it takes linear time to get these values. Instead we might store these values and update them at every edge/node addition and deletion.
    22
    33Of course this change would slow down these operations a bit.