| ID | 71380 | ||||||
|---|---|---|---|---|---|---|---|
| Build | python-toposort-1.10-13.fc42 | ||||||
| Name | python3-toposort | ||||||
| Version | 1.10 | ||||||
| Release | 13.fc42 | ||||||
| Epoch | |||||||
| Arch | noarch | ||||||
| Draft | False | ||||||
| Summary | Implements a topological sort algorithm | ||||||
| Description | In computer science, a topological sort (sometimes abbreviated topsort or toposort) or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. | ||||||
| Build Time | 2025-01-18 20:15:35 GMT | ||||||
| Size | 20.00 KB | ||||||
| 65d4bc2a5bd6efa2a63f26e164ca4bf1 | |||||||
| License | Apache-2.0 | ||||||
| Provides |
|
||||||
| Obsoletes | No Obsoletes | ||||||
| Conflicts | No Conflicts | ||||||
| Requires |
|
||||||
| Recommends | No Recommends | ||||||
| Suggests | No Suggests | ||||||
| Supplements | No Supplements | ||||||
| Enhances | No Enhances | ||||||
| Files | |||||||
| Component of | No Buildroots |
