-
The current naive `filepath.WalkDir` runs into two issues:
- Is blocked by mac permission checks on directories like Downloads.
- Time taken is in proportion to how deep the tree can go. EG from $HOME…
-
Is this performant enough to work in DBD?
I wrote a similar program but it just does color detection and uses a greedy algorithm
I don't know what yours does exactly you say it is optimal so I …
-
Feature request: It would be really helpful to be a be able to apply arbitrary styles to vertices and edges, rather than only having selected/common states. For example, when trying to illustrate Dijk…
-
The following error is raised when using the fitness function:
`concurrent.futures.process.BrokenProcessPool: A process in the process pool was terminated abruptly while the future was running or p…
-
-
BFS monsters should not use the same path if they are close to each other. They should capture the player together.
-
### Detailed description
I'd like to write an implementation for an indexed priority queue data structure for the project.
It will be relatively simple, and mainly for educational purposes.
I wil…
-
The best algorithm for finding shortest possible path in a graph.
-
At the moment, there are several methods that compute shortest paths. However, there is no standard for inputs and outputs of these methods:
* some of them only work with unweighted graphs (distanc…
-
### Requirements of this design
1. Maintaining active connections between nodes to form a 'strongly connected' network.
2. Decentralised connection forming and `NAT` punching.
3. Decentralised me…