New answers tagged pathfinding
            
                3
            
            votes
        
        
            
        Dijkstra's algorithm for non-uniform undirected hypergraphs: Take II - bidirectional Dijkstra's algorithm with excellent performance
                    Always document your generic parameters. Since all methods in the class take the same parameters, it might be easier to document them if the methods were instance methods instead of static.
You have ...
                
            
       
        
            
                3
            
            votes
        
        
            
        Dijkstra's algorithm for non-uniform undirected hypergraphs
                    I'll just focus on the code, as math and related subjects are generally better answered by anybody but me. In general the code looks quite good though, so I'll start with that.
The good
Guard ...
                
            
       
        Top 50 recent answers are included
Related Tags
pathfinding × 254algorithm × 103
java × 70
graph × 57
c++ × 53
python × 52
performance × 49
c# × 31
a-star × 25
programming-challenge × 24
breadth-first-search × 20
python-3.x × 16
time-limit-exceeded × 15
recursion × 14
c × 12
javascript × 11
beginner × 10
matrix × 9
depth-first-search × 9
game × 7
interview-questions × 7
python-2.x × 6
library × 6
dijkstra × 6
object-oriented × 5