build: set tsconfig noUncheckedIndexedAccess to true

Author: JesusTheHun

src/Graph.ts

@@ -67,7 +67,7 @@ export class Graph<Node = string, LinkProps = never> {
   }
 
   /**
-   * Gets the adjacent node set for the given node.
+   * Gets the adjacent nodes set for the given node.
    */
   adjacent(node: Node): Set<Node> | undefined {
     return this.edges.get(node);

src/algorithms/depthFirstSearch/depthFirstSearch.ts

@@ -1,3 +1,4 @@
+import { invariant } from '../../invariant.js';
 import type { NoInfer } from '../../types.js';
 import type { DepthFirstSearchOptions } from './types.js';
 
@@ -20,18 +21,25 @@ export function depthFirstSearch<Node, LinkProps>(
 
   if (includeSourceNodes) {
     for (let i = 0; i < sourceNodes.length; i++) {
-      depthFirstVisit(graph, nodeList, visited, visiting, sourceNodes[i], opts);
+      const sourceNode = sourceNodes[i];
+      if (!sourceNode) continue;
+      depthFirstVisit(graph, nodeList, visited, visiting, sourceNode, opts);
     }
     return nodeList;
   }
 
   for (let i = 0; i < sourceNodes.length; i++) {
-    visited.add(sourceNodes[i]);
+    const sourceNode = sourceNodes[i];
+    if (!sourceNode) continue;
+    visited.add(sourceNode);
   }
 
   for (let i = 0; i < sourceNodes.length; i++) {
+    const sourceNode = sourceNodes[i];
+    if (!sourceNode) continue;
+
     graph
-      .adjacent(sourceNodes[i])
+      .adjacent(sourceNode)
       ?.forEach((n) => depthFirstVisit(graph, nodeList, visited, visiting, n, opts));
   }
 

src/algorithms/shortestPath/dijkstra.ts

@@ -11,7 +11,7 @@ export function dijkstra<Node, LinkProps>(
   destination: NoInfer<Node>,
 ) {
   const nodes = graph.nodes;
-  const { d, p, q } = tracks;
+  const { q } = tracks;
 
   initializeSingleSource(nodes, tracks, source, destination);
   initializePriorityQueue(nodes, tracks);

src/algorithms/shortestPath/shortestPath.ts

@@ -1,5 +1,5 @@
 import { Graph } from '../../Graph.js';
-import { EdgeWeight, NoInfer } from '../../types.js';
+import { NoInfer } from '../../types.js';
 import { dijkstra } from './dijkstra.js';
 import { getPath } from './getPath.js';
 import { TraversingTracks } from './types.js';

src/test-utils.ts

@@ -9,10 +9,10 @@ export function checkSerialized(graph: Serialized<string>) {
   expect(graph.nodes[1]).toEqual('b');
   expect(graph.nodes[2]).toEqual('c');
 
-  expect(graph.links[0].source).toEqual('a');
-  expect(graph.links[0].target).toEqual('b');
-  expect(graph.links[1].source).toEqual('b');
-  expect(graph.links[1].target).toEqual('c');
+  expect(graph.links[0]?.source).toEqual('a');
+  expect(graph.links[0]?.target).toEqual('b');
+  expect(graph.links[1]?.source).toEqual('b');
+  expect(graph.links[1]?.target).toEqual('c');
 }
 
 export function comesBefore(arr: ReadonlyArray<unknown>, a: unknown, b: unknown) {

src/utils/getNode.ts

@@ -24,5 +24,5 @@ export function getNode<Node>(
     throw new Error('More than one node found.');
   }
 
-  return foundNodes[0];
+  return foundNodes[0] as Node;
 }

tsconfig.json

@@ -9,6 +9,7 @@
     "noImplicitAny": true,
     "noImplicitReturns": true,
     "noImplicitThis": true,
+    "noUncheckedIndexedAccess": true,
     "downlevelIteration": true,
     "isolatedModules": true,
     "noEmit": true,