diff --git a/algorithms/BFS.md b/algorithms/BFS.md index 328170cd0..71d099dfd 100644 --- a/algorithms/BFS.md +++ b/algorithms/BFS.md @@ -1,11 +1,7 @@ --- title: Breadth First Search Algorithm Implementation and Analysis category: algorithms -tags: - - graph-traversal - - shortest-paths - - graph-theory - - complexity-analysis +tags: [graph-traversal, shortest-paths, graph-theory, complexity-analysis] description: A comprehensive explanation of the Breadth First Search (BFS) algorithm, including implementation, complexity analysis, and mathematical proofs. The document covers the algorithm's properties for finding shortest paths in graphs and includes Python implementations with detailed theoretical foundations and lemmas about level ordering. --- # Breadth First Search diff --git a/site/README.html b/site/README.html index c91338a56..859e9b513 100644 --- a/site/README.html +++ b/site/README.html @@ -171,6 +171,7 @@