Update readme and project tags with A* (#228)

antonioaversa · Oct 2, 2022 · f44591d · f44591d
1 parent 83a5bf8
commit f44591d
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/MoreStructures/MoreStructures.csproj b/MoreStructures/MoreStructures.csproj
@@ -22,7 +22,7 @@ Suffix Trees and Tries construction and matching.
 		algorithms, data-structures, structures, data, lists, trees, graphs, stacks, queues, priority queues, heaps, 
 		binary heaps, binomial heaps, Fibonacci heaps, disjoint sets, quick union, quick find, suffix trees, 
 		suffix tries, sorting, matching, searching, DFS, BFS, Ukkonen, Dijkstra, Bellman-Ford, Kasai, Burrows-Wheeler 
-		Transform, suffix array, LCP array, Knuth-Morris-Pratt, Prim, Kruskal, shortest path
+		Transform, suffix array, LCP array, Knuth-Morris-Pratt, Prim, Kruskal, shortest path, A*
 	</PackageTags>
   </PropertyGroup>
 

diff --git a/README.md b/README.md
@@ -27,7 +27,7 @@ Algorithms implemented include:
 - __Tree visit__: DFS, BFS, in iterative and recursive forms;
 - __Graphs visits__: DFS, BFS, in iterative and recursive forms;
 - __Graphs minimum spanning tree__: Kruskal, Prim;
-- __Graphs shortest distance__: Dijkstra, bidirectional Dijkstra, Bellman-Ford, BFS-based;
+- __Graphs shortest distance__: Dijkstra, bidirectional Dijkstra, Bellman-Ford, BFS-based, A*, bidirectional A*;
 - __Graphs shortest path__: BFS-based;
 - __Graphs topological sorting__: DFS on each vertex, any path to sink, single DFS sink-based;
 - __Graphs strongly connected components__: sink-based;