Opened 15 years ago
Last modified 14 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 )
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 14 years ago by
| Description: | modified (diff) |
|---|---|
| Owner: | changed from Peter Kovacs to Alpar Juttner |
Note: See
TracTickets for help on using
tickets.
Other examples where this information is missing: