graph-pathfinding-algorithms
java-algorithms-implementation
| graph-pathfinding-algorithms | java-algorithms-implementation | |
|---|---|---|
| 2 | 2 | |
| 5 | 4,362 | |
| - | - | |
| 3.2 | 0.0 | |
| 8 months ago | over 1 year ago | |
| Java | Java | |
| MIT License | Apache License 2.0 |
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
- 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
java-algorithms-implementation
What are some alternatives?
FXGraphAlgorithmSimulator - Visualizes specific Graph Algorithms like BFS, DFS, MST etc. on interactive user input graphs.
Java - All Algorithms implemented in Java
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.
Leetcode - Solutions to LeetCode problems; updated daily. Subscribe to my YouTube channel for more.
AlgoDS - Implementation of Algorithms and Data Structures, Problems and Solutions
algorithms - Minimal examples of data structures and algorithms in Python
data-structures - A collection of powerful data structures
algorithms - CLRS study. Codes are written with golang.
Java String Similarity - Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
happytree - Java Object Model API to transform linear objects with tree behavior into real trees. Handle these objects as if they were nodes of a tree.