chore: merge Fix/742 migrate doctest to jest (#749)

* Remove QuickSelect doctest

There are more Jest test cases already.

* Remove AverageMedian doctest

Already migrated to jest

* Migrate doctest for BinaryExponentiationRecursive.js

(also remove inline "main" test method)

* Migrate doctest for EulersTotient.js

(also remove inline "main" test method)

* Migrate doctest for PrimeFactors.js

(also remove inline "main" test method)

* Migrate doctest for BogoSort.js

Re-write prototype-polluting helper methods, too.

(also remove inline test driver code)

* Migrate doctest for BeadSort.js

(also remove inline test driver code)

* Migrate doctest for BucketSort.js

(also remove inline test driver code)

* Migrate doctest for CocktailShakerSort.js

(also remove inline test driver code)

* Migrate doctest for MergeSort.js

(also remove inline test driver code)

* Migrate doctest for QuickSort.js

(also remove inline test driver code)

* Migrate doctest for ReverseString.js

(also remove inline test driver code)

* Migrate doctest for ReverseString.js

* Migrate doctest for ValidateEmail.js

* Migrate doctest for ConwaysGameOfLife.js

(remove the animate code, too)

* Remove TernarySearch doctest

Already migrated to jest

* Migrate doctest for BubbleSort.js

(also remove inline test driver code)

* Remove doctest from CI and from dependencies

relates to #742
fixes #586

* Migrate doctest for RgbHsvConversion.js

* Add --fix option to "standard" npm script

* Migrate doctest for BreadthFirstSearch.js

(also remove inline test driver code)

* Migrate doctest for BreadthFirstShortestPath.js

(also remove inline test driver code)

* Migrate doctest for EulerMethod.js

(also remove inline test driver code)

Move manual test-code for plotting stuff in the browser in a distinct file, too. Those "*.manual-test.js" files are excluded from the UpdateDirectory.mjs script, as well.

* Migrate doctest for Mandelbrot.js

(also remove inline test driver code & moved manual drawing test into a *.manual-test.js)

* Migrate doctest for FloodFill.js

* Migrate doctest for KochSnowflake.js

(also move manual drawing test into a *.manual-test.js)

* Update npm lockfile

* Update README and COMMITTING with a few bits & bobs regarding testing & code quality

Graphs/BreadthFirstShortestPath.js

@@ -1,25 +1,13 @@
-/*
-Breadth-first approach can be applied to determine the shortest path between two nodes
-in an equi-weighted graph. It searches the target node among all neighbors of the
-starting node, then the process is repeated on the level of the neighbors of the
-neighbors and so on.
-(See also: https://en.wikipedia.org/wiki/Breadth-first_search )
-(see also: https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core )
-*/
-
-/*
-Doctests
-> breadthFirstShortestPath(graph, 'C', 'E')
-[ 'C', 'D', 'A', 'B', 'E' ]
-> breadthFirstShortestPath(graph, 'E', 'B')
-[ 'E', 'D', 'A', 'B' ]
-> breadthFirstShortestPath(graph, 'F', 'G')
-[ 'F', 'G' ]
-> breadthFirstShortestPath(graph, 'A', 'G')
-[]
-*/
-
-function breadthFirstShortestPath (graph, startNode, targetNode) {
+/**
+ * Breadth-first approach can be applied to determine the shortest path between two nodes in an equi-weighted graph.
+ *
+ * It searches the target node among all neighbors of the starting node, then the process is repeated on the level of
+ * the neighbors of the neighbors and so on.
+ *
+ * @see https://en.wikipedia.org/wiki/Breadth-first_search
+ * @see https://www.koderdojo.com/blog/breadth-first-search-and-shortest-path-in-csharp-and-net-core
+ */
+export function breadthFirstShortestPath (graph, startNode, targetNode) {
   // check if startNode & targetNode are identical
   if (startNode === targetNode) {
     return [startNode]
@@ -62,27 +50,3 @@ function breadthFirstShortestPath (graph, startNode, targetNode) {
   // the target node was not reachable
   return []
 }
-
-const graph = {
-  A: ['B', 'D'],
-  B: ['E'],
-  C: ['D'],
-  D: ['A'],
-  E: ['D'],
-  F: ['G'],
-  G: []
-}
-/*
-      A <-> B
-      ʌ     |
-      |     |
-      v     v
-C --> D <-- E
-
-F --> G
-*/
-
-console.log(breadthFirstShortestPath(graph, 'C', 'E'))
-console.log(breadthFirstShortestPath(graph, 'E', 'B'))
-console.log(breadthFirstShortestPath(graph, 'F', 'G'))
-console.log(breadthFirstShortestPath(graph, 'A', 'G'))