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 #358


Ignore:
Timestamp:
01/09/11 18:00:27 (13 years ago)
Author:
Peter Kovacs
Comment:

Other examples where this information is missing:

  • Bfs, Dfs, Dijkstra
  • Circulation
  • Suurballe
  • min cost flow classes
  • etc.

Legend:

Unmodified
Added
Removed
Modified

  • Ticket #358

    • Property Owner changed from Peter Kovacs to Alpar Juttner

  • Ticket #358 – Description

    initial v1  
    1 Some algorithms such as MaxWeightedPerfectMatching include the complexity of the runtime. Others such as MaxMatching do not. It might be nice to add this information to the documentation of every algorithm object.
     1Some algorithms such as `MaxWeightedPerfectMatching` include the complexity of the runtime. Others such as `MaxMatching` do not. It might be nice to add this information to the documentation of every algorithm object.