Build and packaging library
- Python 54.1%
- Makefile 33.7%
- Shell 12.2%
| Filename | Latest commit message | Latest commit date |
|---|---|---|
Jan Lindemann
59998ae00b
__find_circular_deps_recursive() builds the cycle path by inserting each visited dependency at the front of the list on the way back up, and __find_circular_deps() appends the project where the cycle was detected at the end. The path therefore starts at the first child of the DFS root instead of at the project that closes the cycle, and the closing project appears twice: for a dependency cycle between projects A and B, find_circular_deps() reports "B -> A -> A" instead of "A -> B -> A". Keep the DFS stack as an ordered list, and when a dependency is already on the stack, return the part of the stack from that dependency to the top, plus the dependency itself, which starts and ends at the same project. Reverse the result before returning, because an edge a -> b in the flipped graph means that b depends on a, so the cycle is reported in the original dependency direction. Assisted-by: unsloth/Qwen3.8-27B-GGUF:Q4_K_M with pi.dev v0.84.2 Signed-off-by: Jan Lindemann <jan@janware.com> |
||
| .github/workflows | ||
| bin | ||
| conf | ||
| doc | ||
| make | ||
| scripts | ||
| src | ||
| test | ||
| .gitignore | ||
| HASH | ||
| Makefile | ||
| RELEASES | ||
| VERSION | ||