From f44591d9b15e0dfd793d47d7359e11a0c4d691e4 Mon Sep 17 00:00:00 2001 From: Antonio Aversa Date: Mon, 3 Oct 2022 00:08:53 +0200 Subject: [PATCH] Update readme and project tags with A* (#228) --- MoreStructures/MoreStructures.csproj | 2 +- README.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/MoreStructures/MoreStructures.csproj b/MoreStructures/MoreStructures.csproj index 96c9499e..1edfb369 100644 --- 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* diff --git a/README.md b/README.md index da12aa21..4d6acc62 100644 --- 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;