Opened 15 years ago
Last modified 14 years ago
#358 new enhancement
Runtime complexity for every algorithm — at Initial Version
| Reported by: | Ben Strasser | Owned by: | Peter Kovacs |
|---|---|---|---|
| Priority: | minor | Milestone: | |
| Component: | documentation | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description
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.
Note: See
TracTickets for help on using
tickets.
