All issues

Search results

components clones every group, and kuhn_munkres hashes a list it never looks up

Status: Open.

#818 In evenfurther/pathfinding;

· tachsin opened on Sep 9, 2026

Two unsafe impl Send in edmonds_karp that the compiler already provides

Status: Open.

#817 In evenfurther/pathfinding;

· tachsin opened on Sep 9, 2026

edmonds_karp builds the flow list twice and clones the sparse map to read it

Status: Open.

#816 In evenfurther/pathfinding;

· tachsin opened on Sep 9, 2026

count_paths overflows the stack on deep graphs, loop or no loop

Status: Open.

#814 In evenfurther/pathfinding;

· tachsin opened on Sep 9, 2026

Steppable versions of A* (astar_reach) and of other algorithms

Status: Open.

#775 In evenfurther/pathfinding;

· mikwielgus opened on Jun 29, 2026

Try another hash algorithm

Status: Open.

#741 In evenfurther/pathfinding;

· samueltardieu opened on Jan 3, 2026

Implementing the SSSP algorithm

Status: Open.

#730 In evenfurther/pathfinding;

· Kerollmops opened on Dec 20, 2025

Using aHash instead of std HashMap in dijkstra algorithm?

Status: Open.

#728 In evenfurther/pathfinding;

· rvalavi opened on Nov 28, 2025

topological sorting via vec instead of array

Status: Open.

#714 In evenfurther/pathfinding;

· AV3RG opened on Oct 22, 2025

New Paper Breaking dykstra time bound?: Possible New Algorithm

Status: Open.

#702 In evenfurther/pathfinding;

· MatteMatto opened on Sep 15, 2025

Feature Request: Multi-goal support for all pathfinding algorithms (Dijkstra, A*, BFS, etc.)

Status: Open.

#690 In evenfurther/pathfinding;

· Tavi007 opened on Jul 30, 2025

Add tiebreak support to A* implementation

enhancement

Status: Open.

#681 In evenfurther/pathfinding;

· cwoodhayes opened on May 31, 2025