COIN-OR::LEMON - Graph Library

Opened 9 years ago

Last modified 20 months ago

#251 new enhancement

More efficient graph copying

Reported by: kpeter Owned by: alpar
Priority: major Milestone: LEMON 1.5 release
Component: core Version: hg main
Keywords: Cc:
Revision id:

Description (last modified by kpeter)

Is there any way to make graph copying faster for graph types like List(Di)Graph and Smart(Di)Graph?

Maybe 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.

I'm not sure about the implementation, but I think this method would have two advantages:

  • It could be faster.
  • 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.

Change History (3)

comment:1 Changed 8 years ago by kpeter

  • Description modified (diff)
  • Milestone changed from LEMON 1.2 release to LEMON 1.3 release

comment:2 Changed 5 years ago by alpar

  • Milestone changed from LEMON 1.3 release to LEMON 1.4 release

comment:3 Changed 20 months ago by alpar

  • Milestone changed from LEMON 1.4 release to LEMON 1.5 release
Note: See TracTickets for help on using tickets.