remove alpha note

earlygrey · Jul 19, 2020 · 7f3e690 · 7f3e690
1 parent 6d32a71
commit 7f3e690
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 4 deletions.
diff --git a/README.md b/README.md
@@ -1,8 +1,6 @@
 
 [![](https://jitpack.io/v/earlygrey/simple-graphs.svg)](https://jitpack.io/#space.earlygrey/simple-graphs)
 
-*note: still in "alpha"*
-
 # Simple Graphs
 
 Simple graphs is a Java library containing basic graph data structures and algorithms. It is lightweight, fast, and intuitive to use.

diff --git a/src/main/java/space/earlygrey/simplegraphs/Algorithms.java b/src/main/java/space/earlygrey/simplegraphs/Algorithms.java
@@ -53,7 +53,7 @@ public Path<V> findShortestPath(V start, V target) {
      * Find the shortest path between the start and target vertices, using Dijkstra's algorithm implemented with a priority queue.
      * @param start the starting vertex
      * @param target the target vertex
-     * @param path a path object to reuse
+     * @param path a path instance to reuse
      * @return a list of vertices from start to target containing the ordered vertices of a shortest path, including both the start and target vertices
      */
     public Path<V> findShortestPath(V start, V target, Path<V> path) {
@@ -76,7 +76,7 @@ public Path<V> findShortestPath(V start, V target, Heuristic<V> heuristic) {
      * @param start the starting vertex
      * @param target the target vertex
      * @param heuristic a heuristic to guide the search
-     * @param path a path object to reuse
+     * @param path a path instance to reuse
      * @return a list of vertices from start to target containing the ordered vertices of a shortest path, including both the start and target vertices
      */
     public Path<V> findShortestPath(V start, V target, Heuristic<V> heuristic, Path<V> path) {