graphs-cpp
Weighted and unweighted graphs and digraphs with C++ (by nspo)
c-plus-plus-pathfinder
Create shortest path traversals in grid graphs using C++ with a fast and unique pathfinding algorithm. (by frymimori)
| graphs-cpp | c-plus-plus-pathfinder | |
|---|---|---|
| 1 | 1 | |
| 16 | 1 | |
| - | - | |
| 1.8 | 10.0 | |
| over 3 years ago | 11 months ago | |
| C++ | C++ | |
| BSD 3-clause "New" or "Revised" License | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
graphs-cpp
Posts with mentions or reviews of graphs-cpp.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-08-23.
-
Open Source Graph libraries written in modern C++?
This has quite a few graph algorithms for unweighted/weighted graphs/digraphs and flow networks: https://github.com/nspo/graphs-cpp
c-plus-plus-pathfinder
Posts with mentions or reviews of c-plus-plus-pathfinder.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-06-07.
-
any angle pathfinding algorithm c++ implementation
I've built what you're requesting in both C and C++ with both diagonal and non-diagonal movement using my own algorithm.
What are some alternatives?
When comparing graphs-cpp and c-plus-plus-pathfinder you can also consider the following projects:
parallel-dfs-dag - A parallel implementation of DFS for Directed Acyclic Graphs (https://research.nvidia.com/publication/parallel-depth-first-search-directed-acyclic-graphs)
CGal - The public CGAL repository, see the README below
FunctionalPlus - Functional Programming Library for C++. Write concise and readable C++ code.
varia