refactor: ran prettier on project

Author: Nejc

src/algorithms/graph/a-star-search-algorithm/index.test.ts

@@ -65,10 +65,7 @@ describe('AStar', () => {
     const getHeuristic: HeuristicCallbackKeys = (i, j) =>
       (graph.getVertex(i)?.value || 0) + (graph.getVertex(j)?.value || 0);
 
-    expect(aStarGraph(graph, 'A', 'H', getHeuristic)).toEqual([
-      ['A', 'C', 'G', 'H'],
-      10,
-    ]);
+    expect(aStarGraph(graph, 'A', 'H', getHeuristic)).toEqual([['A', 'C', 'G', 'H'], 10]);
   });
 
   it('should find shortest path between vertices in matrix', () => {

src/algorithms/graph/a-star-search-algorithm/index.ts

@@ -1,8 +1,6 @@
 // http://theory.stanford.edu/~amitp/GameProgramming/Heuristics.html
 import {Graph, Key} from '../../../data-structures/graph';
-import createPriorityQueue, {
-  Item,
-} from '../../../data-structures/priority-queue';
+import createPriorityQueue, {Item} from '../../../data-structures/priority-queue';
 
 export type HeuristicCallbackIndexes = (i: number, j: number) => number;
 export type HeuristicCallbackKeys = (i: Key, j: Key) => number;
@@ -129,8 +127,7 @@ export default function aStar(
 
       // update distances to every connected vertex
       const distanceToNext = nextData.distance;
-      const completeDistance =
-        currentData.distance + matrix[currentIndex][index];
+      const completeDistance = currentData.distance + matrix[currentIndex][index];
 
       // if the distance is shorter than update it
       if (completeDistance < distanceToNext) {

src/algorithms/graph/articulation-points/index.ts

@@ -5,9 +5,7 @@ export type VertexMeta = {
   lowDiscoveryTime: number;
 };
 
-export default function articulationPoints<T>(
-  graph: Graph<T>,
-): Vertex<T>[] | undefined {
+export default function articulationPoints<T>(graph: Graph<T>): Vertex<T>[] | undefined {
   // is empty
   if (graph.isEmpty()) return undefined;
 
@@ -47,10 +45,7 @@ export default function articulationPoints<T>(
         const vMeta = visited.get(vertex.key) as VertexMeta;
         const nMeta = visited.get(nKey) as VertexMeta;
         // update current vertex low discovery time
-        vMeta.lowDiscoveryTime = Math.min(
-          vMeta.lowDiscoveryTime,
-          nMeta.lowDiscoveryTime,
-        );
+        vMeta.lowDiscoveryTime = Math.min(vMeta.lowDiscoveryTime, nMeta.lowDiscoveryTime);
         visited.set(vertex.key, vMeta);
 
         // vertex is root and has two or more children
@@ -68,10 +63,7 @@ export default function articulationPoints<T>(
         const vMeta = visited.get(vertex.key) as VertexMeta;
         const nMeta = visited.get(nKey) as VertexMeta;
         // update current vertex low discovery time
-        vMeta.lowDiscoveryTime = Math.min(
-          vMeta.lowDiscoveryTime,
-          nMeta.discoveryTime,
-        );
+        vMeta.lowDiscoveryTime = Math.min(vMeta.lowDiscoveryTime, nMeta.discoveryTime);
         visited.set(vertex.key, vMeta);
       }
     }

src/algorithms/graph/bridges/index.ts

@@ -43,10 +43,7 @@ export default function bridges<T>(graph: Graph<T>): [Key, Key][] | undefined {
         const vMeta = visited.get(vertex.key) as VertexMeta;
         const nMeta = visited.get(nKey) as VertexMeta;
         // update current vertex low discovery time
-        vMeta.lowDiscoveryTime = Math.min(
-          vMeta.lowDiscoveryTime,
-          nMeta.lowDiscoveryTime,
-        );
+        vMeta.lowDiscoveryTime = Math.min(vMeta.lowDiscoveryTime, nMeta.lowDiscoveryTime);
         visited.set(vertex.key, vMeta);
 
         // vertex is not root and low discovery time of one of its connected vertices
@@ -60,10 +57,7 @@ export default function bridges<T>(graph: Graph<T>): [Key, Key][] | undefined {
         const vMeta = visited.get(vertex.key) as VertexMeta;
         const nMeta = visited.get(nKey) as VertexMeta;
         // update current vertex low discovery time
-        vMeta.lowDiscoveryTime = Math.min(
-          vMeta.lowDiscoveryTime,
-          nMeta.discoveryTime,
-        );
+        vMeta.lowDiscoveryTime = Math.min(vMeta.lowDiscoveryTime, nMeta.discoveryTime);
         visited.set(vertex.key, vMeta);
       }
     }

src/algorithms/graph/depth-first-search/index.ts

@@ -1,11 +1,7 @@
 import {Graph, Key, Vertex} from '../../../data-structures/graph';
 
 // return data that will be passed to next function call
-export type Callback<T> = (
-  key: Key,
-  vertex: Vertex<T>,
-  data?: unknown,
-) => unknown | void;
+export type Callback<T> = (key: Key, vertex: Vertex<T>, data?: unknown) => unknown | void;
 
 export interface Options<T> {
   visitCallback: Callback<T>;

src/algorithms/graph/detect-cycle/undirected.ts

@@ -3,9 +3,7 @@ import {Graph, Key, Vertex} from '../../../data-structures/graph';
 export default function detectCycle<T>(graph: Graph<T>): boolean {
   // is directed
   if (graph.directed) {
-    throw new Error(
-      'Detect cycle algorithms works only for undirected graphs.',
-    );
+    throw new Error('Detect cycle algorithms works only for undirected graphs.');
   }
   // is empty
   if (graph.isEmpty()) return false;

src/algorithms/graph/detect-cycle/undirectedDisjointSet.ts

@@ -4,9 +4,7 @@ import {Graph} from '../../../data-structures/graph';
 export default function detectCycle<T>(graph: Graph<T>): boolean {
   // is directed
   if (graph.directed) {
-    throw new Error(
-      'Detect cycle algorithms works only for undirected graphs.',
-    );
+    throw new Error('Detect cycle algorithms works only for undirected graphs.');
   }
   // is empty
   if (graph.isEmpty()) return false;

src/algorithms/graph/dijkstra/index.ts

@@ -1,7 +1,5 @@
 import {Edge, Graph, Key} from '../../../data-structures/graph';
-import createPriorityQueue, {
-  Item,
-} from '../../../data-structures/priority-queue';
+import createPriorityQueue, {Item} from '../../../data-structures/priority-queue';
 
 export default function dijkstra<T>(
   graph: Graph<T>,

src/algorithms/graph/floyd-warshall/index.test.ts

@@ -82,15 +82,7 @@ describe('FloydWarshall', () => {
 
     const {vertices, distances} = floydWarshall(graph) || {};
 
-    expect(vertices?.map((v) => v.key)).toEqual([
-      'A',
-      'B',
-      'C',
-      'D',
-      'E',
-      'F',
-      'G',
-    ]);
+    expect(vertices?.map((v) => v.key)).toEqual(['A', 'B', 'C', 'D', 'E', 'F', 'G']);
     expect(distances).toEqual([
       [0, 0, 2, Infinity, Infinity, Infinity, Infinity],
       [1, 0, 3, Infinity, Infinity, Infinity, Infinity],

src/algorithms/graph/hamiltonian-cycle/index.ts

@@ -6,9 +6,7 @@ export default function hamiltonianCycle<T>(
 ): Key[][] | undefined {
   // is directed
   if (graph.directed) {
-    throw new Error(
-      'Hamiltonian cycle algorithms works only for undirected graphs.',
-    );
+    throw new Error('Hamiltonian cycle algorithms works only for undirected graphs.');
   }
   // is empty
   if (graph.isEmpty()) return undefined;