Timeline for Find permutation that satisfies conditions
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7 at 16:25 | comment | added | Najib Idrissi |
@azerbajdzan You could always check if the graph satisfies AcyclicGraphQ, return TopologicalSort if that's the case, and fail otherwise.
|
|
| May 7 at 16:24 | vote | accept | azerbajdzan | ||
| May 7 at 16:23 | comment | added | azerbajdzan |
Nice, it returns unevaluated TopologicalSort if rules are contradictory, i.e. no solution exists.
|
|
| May 7 at 16:14 | history | answered | Najib Idrissi | CC BY-SA 4.0 |