COIN-OR::LEMON - Graph Library

Opened 10 years ago

Last modified 9 years ago

#358 new enhancement

Runtime complexity for every algorithm

Reported by: Ben Strasser Owned by: Alpar Juttner
Priority: minor Milestone:
Component: documentation Version: hg main
Keywords: Cc:
Revision id:

Description (last modified by Peter Kovacs)

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.

Change History (1)

comment:1 Changed 9 years ago by Peter Kovacs

Description: modified (diff)
Owner: changed from Peter Kovacs to Alpar Juttner

Other examples where this information is missing:

  • Bfs, Dfs, Dijkstra
  • Circulation
  • Suurballe
  • min cost flow classes
  • etc.
Note: See TracTickets for help on using tickets.