COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changes between Initial Version and Version 1 of Ticket #251


Ignore:
Timestamp:
11/04/09 18:42:02 (15 years ago)
Author:
Peter Kovacs
Comment:

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #251

    • Property Milestone changed from LEMON 1.2 release to LEMON 1.3 release

  • Ticket #251 – Description

    initial v1  
    33Maybe we could have specialized versions of `(di)graphCopy()` for the cases when both types are the same, e.g. list or smart graph, which function would directly copy the vectors that represent the graph.
    44
    5 I'm not sure about the implementation, but I think this method would have two advantage:
     5I'm not sure about the implementation, but I think this method would have two advantages:
    66 - It could be faster.
    77 - It would keep the node, arc and/or edge ids and the order of the items. Now if you have a `SmartDigraph` and copies it to another `SmartDigraph` structure, then the iteration orders of the nodes and arcs are reversed.