About 26,700,000 results
Open links in new tab
  1. algorithm - Bellman-Ford vs Dijkstra: Under what circumstances is ...

    76 After a lot of Googling, I've found that most sources say that the Dijkstra algorithm is "more efficient" than the Bellman-Ford algorithm. But under what circumstances is the Bellman-Ford …

  2. algorithm - When should I use Kruskal as opposed to Prim (and …

    Mar 20, 2019 · I was wondering when one should use Prim's algorithm and when Kruskal's to find the minimum spanning tree? They both have easy logics, same worst cases, and only …

  3. The best shortest path algorithm - Stack Overflow

    What is the difference between the "Floyd-Warshall algorithm" and "Dijkstra's Algorithm", and which is the best for finding the shortest path in a graph? I need to calculate the shortest path …

  4. Is there an efficient algorithm to generate a 2D concave hull?

    The answer may still be interesting for somebody else: One may apply a variation of the marching square algorithm, applied (1) within the concave hull, and (2) then on (e.g. 3) different scales …

  5. is dijkstra an A* algorithm? - Stack Overflow

    May 23, 2025 · The A* algorithm algorithm can be seen as a generalisation of Dijkstra's algorithm, but there is one caveat: Dijkstra's algorithm can be used to efficiently find shortest paths to all …

  6. What is the difference between a heuristic and an algorithm?

    Feb 25, 2010 · An algorithm is the description of an automated solution to a problem. What the algorithm does is precisely defined. The solution could or could not be the best possible one …

  7. Why am I getting "Invalid algorithm specified" exception

    "Invalid algorithm specified" Took me forever to figure out and I tried practically everything. Step 1 - the certificate has to be SHA512 and use a CSP (Cryptographic Service Provider) that is …

  8. logic - How does the DPLL algorithm work? - Stack Overflow

    Sep 23, 2012 · This algorithm is taken from the book Artificial Intelligence A modern approach. I'm finding it really confusing with those many function recursions. In particular, what does the …

  9. Circle line-segment collision detection algorithm? - Stack Overflow

    Jul 2, 2009 · I have a line from A to B and a circle positioned at C with the radius R. What is a good algorithm to use to check whether the line intersects the circle? And at what coordinate …

  10. c - How is a CRC32 checksum calculated? - Stack Overflow

    Your code is a bit hard to understand, partly because it's incomplete: temp and testcrc are not declared, so it's unclear what's being indexed, and how much data is running through the …