Opened 16 years ago
Closed 16 years ago
#410 closed enhancement (duplicate)
Theoretical running time for algorithms
| Reported by: | Peter Kovacs | Owned by: | Peter Kovacs |
|---|---|---|---|
| Priority: | major | Milestone: | LEMON 1.3 release |
| Component: | documentation | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description
The theoretical running time of the algorithms should be displayed in the doc if it can be determined.
Change History (2)
comment:1 Changed 16 years ago by
comment:2 Changed 16 years ago by
| Resolution: | → duplicate |
|---|---|
| Status: | new → closed |
I'm sorry. This issue has already reported in another ticket: #358.
Note: See
TracTickets for help on using
tickets.
For example, the running time info is missing for Bfs, Dfs, Dijkstra, Circulation, Suurballe, min cost flow classes, etc.
On the other hand, the min cut and matching algorithms are well-documented in this aspect (too).