All Questions
Tagged with pathfinding c
12 questions
4
votes
1
answer
674
views
Multithreading a shortest path algorithm
I would like to modify my shortest path finding code to use multithreading and improve its performance. The algorithm must be able to work with negative weights, and as a result, we cannot use ...
- 263
6
votes
2
answers
334
views
Bellman-Ford optimisation in C with Shortest Path Algorithm (SPFA) and Small Label first (SLF)
I am trying to code an optimized version of Bellman-Ford algorithm. This post is a continuation of the following post Bellman-Ford optimisation in C in which I posted a first version of the classic ...
- 263
6
votes
2
answers
2k
views
3
votes
1
answer
184
views
Traditional vs. bidirectional Dijkstra's algorithm in C
I have this CLion project on GitHub. It constructs a directed, weighted graph consisting of 100 thousand nodes and 500 thousand directed arcs, picks two random nodes, and computes the shortest paths ...
- 31.8k
5
votes
1
answer
203
views
A* and ALT pathfinding in C tips
I adding some pathfinding to a game I'm working on. It primarily used A* with as suggested in the pathfinding articles at reb blob games.
It works, but isn't very fast.
It is a square grid map that (...
- 161
2
votes
1
answer
70
views
Uni- and bidirectional pseudo-generic shortest path finders in C89
I have implemented two related shortest path algorithms for unweighted graphs in C89. My attempt was to learn some more idiomatic C constructs such as genericity (a client programmer should be able to ...
- 31.8k
1
vote
2
answers
113
views
Mapping a robot's obstacles based on its position and sensor data
I have a grid in which I'm adding different cell-blocks to, depending on what rotation I'm currently receiving.
@@@ = Map border
...
- 155
11
votes
3
answers
656
views
Dijkstra's algorithm in C99
I just implement Dijkstra's algorithm in C99. Can you review my code please? I'm looking for any mistake, performance improvement or coding style errors.
main.c
...
- 213
2
votes
1
answer
1k
views
Shortest path from U to V using at most k nodes
I'm trying to solve a problem that asks for a shortest path between two cities with at most k nodes.
The first line of input has the number of test cases. On the second line 3 integers are given, ...
- 607
1
vote
1
answer
1k
views
A* pathfinder in C
Now I have this implementation of A*. Basically it is the same as the Dijkstra's algorithm in my previous post, yet I bothered to make it more cohesive by making functions for handling all the state ...
- 31.8k
4
votes
1
answer
1k
views
Dijkstra's shortest path algorithm in C
Now I have this C implementation of the famous algorithm:
dijkstra.h:
...
- 31.8k
23
votes
3
answers
15k
views
Calculate the number of moves requires for a knight chess piece [closed]
It's possible to work out the number of moves required to move from (0, 0) to (A, B) for a knight on an infinite chess board in O(1) time.
This is an attempt at a solution to do it in O(n) time, ...
- 505