graph-pathfinding-algorithms
Implementation and tests for graph pathfinding algorithms. (by rabestro)
simple-graphs
A simple graph library for java (by earlygrey)
graph-pathfinding-algorithms | simple-graphs | |
---|---|---|
2 | 1 | |
5 | 41 | |
- | - | |
3.2 | 0.0 | |
8 months ago | over 1 year ago | |
Java | Java | |
MIT License | MIT License |
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.
graph-pathfinding-algorithms
Posts with mentions or reviews of graph-pathfinding-algorithms.
We have used some of these posts to build our list of alternatives
and similar projects.
- Code Review - Breadth First Shortest Path
-
Can I use JUnit4 in my projects in JetBrains Academy?
Example. In HyperMetro project you should implement BFS & Dijkstra’s algorithms. I created a separate task and two tests using JUnit and Spock just to compare them. Please take a look: Task: https://github.com/rabestro/algorithms/issues/30 JUnit: https://github.com/rabestro/algorithms/blob/master/algorithm/src/test/java/lv/id/jc/algorithm/graph/SearchAlgorithmsTest.java Spock: https://github.com/rabestro/algorithms/blob/master/algorithm/src/test/groovy/lv/id/jc/algorithm/graph/SearchAlgorithmsSpec.groovy
simple-graphs
Posts with mentions or reviews of simple-graphs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-15.
-
Regular A* in libGDX
I would recommend simple-graphs, or squidlib if your map is a grid. They both have pretty good A* implementations.
What are some alternatives?
When comparing graph-pathfinding-algorithms and simple-graphs you can also consider the following projects:
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
SquidLib - Useful tools for roguelike, role-playing, strategy, and other grid-based games in Java. Feedback is welcome!
jetbrains-academy-hypermetro - Have you ever been worried about getting lost in the subway? Do you need to find a faster route to your destination? Write an application that will help you better navigate the complicated metro system.
JavaFXSmartGraph - Generic (Java FX) Graph Visualization Library