fix: function argument of type Graph now accept Graph with any LinkProps

Author: JesusTheHun

src/Graph.ts

@@ -157,6 +157,7 @@ export class Graph<Node = string, LinkProps = never> {
    */
   removeEdge(source: Node, target: Node): this {
     this.edges.get(source)?.delete(target);
+    this.edgeProperties.get(source)?.delete(target);
 
     return this;
   }

src/algorithms/lowestCommonAncestors/lowestCommonAncestors.ts

@@ -7,8 +7,8 @@ import { NoInfer } from '../../types.js';
  * Inspired by https://github.com/relaxedws/lca/blob/master/src/LowestCommonAncestor.php code
  * but uses depth search instead of breadth. Also uses some optimizations.
  */
-export function lowestCommonAncestors<Node>(
-  graph: Graph<Node>,
+export function lowestCommonAncestors<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   node1: NoInfer<Node>,
   node2: NoInfer<Node>,
 ): Node[] {
@@ -22,8 +22,8 @@ export function lowestCommonAncestors<Node>(
   return lcas;
 }
 
-function CA1Visit<Node>(
-  graph: Graph<Node>,
+function CA1Visit<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   node1Ancestors: Node[],
   lcas: Node[],
   visited: Set<Node>,
@@ -45,8 +45,8 @@ function CA1Visit<Node>(
   }
 }
 
-function CA2Visit<Node>(
-  graph: Graph<Node>,
+function CA2Visit<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   node1Ancestors: Node[],
   lcas: Node[],
   visited: Set<Node>,

src/algorithms/shortestPath/dijkstra.ts

@@ -4,8 +4,8 @@ import { extractMin } from './extractMin.js';
 import { relax } from './relax.js';
 import { TraversingTracks } from './types.js';
 
-export function dijkstra<Node>(
-  graph: Graph<Node>,
+export function dijkstra<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   tracks: TraversingTracks<NoInfer<Node>>,
   source: NoInfer<Node>,
   destination: NoInfer<Node>,

src/algorithms/shortestPath/getPath.ts

@@ -7,8 +7,8 @@ import { Graph } from '../../Graph.js';
  * Assembles the shortest path by traversing the
  * predecessor subgraph from destination to source.
  */
-export function getPath<Node>(
-  graph: Graph<Node>,
+export function getPath<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   tracks: TraversingTracks<NoInfer<Node>>,
   source: NoInfer<Node>,
   destination: NoInfer<Node>,

src/algorithms/shortestPath/relax.ts

@@ -4,7 +4,7 @@ import { NoInfer } from '../../types.js';
 import { TraversingTracks } from './types.js';
 
 export function relax<Node>(
-  graph: Graph<Node>,
+  graph: Graph<Node, any>,
   tracks: TraversingTracks<NoInfer<Node>>,
   source: NoInfer<Node>,
   target: NoInfer<Node>,

src/algorithms/shortestPath/shortestPath.ts

@@ -9,8 +9,8 @@ import { TraversingTracks } from './types.js';
  * Cormen et al. "Introduction to Algorithms" 3rd Ed. p. 658
  * Variable and function names correspond to names in the book.
  */
-export function shortestPath<Node>(
-  graph: Graph<Node>,
+export function shortestPath<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   source: NoInfer<Node>,
   destination: NoInfer<Node>,
 ): {

src/algorithms/shortestPath/shortestPaths.ts

@@ -3,8 +3,8 @@ import type { NoInfer } from '../../types.js';
 import { Graph } from '../../Graph.js';
 import { shortestPath } from './shortestPath.js';
 
-export function shortestPaths<Node>(
-  graph: Graph<Node>,
+export function shortestPaths<Node, LinkProps>(
+  graph: Graph<Node, LinkProps>,
   source: NoInfer<Node>,
   destination: NoInfer<Node>,
 ) {
@@ -13,19 +13,29 @@ export function shortestPaths<Node>(
   const paths = [path];
   const pathWeight = path.weight;
 
-  const removedEdges: { u: Node; v: Node; weight: number }[] = [];
+  const removedEdges: Array<{ u: Node; v: Node; weight: number; props: LinkProps }> = [];
 
   while (path.weight) {
     const u = path.nodes[0];
     const v = path.nodes[1];
 
     if (graph.hasEdge(u, v)) {
-      removedEdges.push({ u, v, weight: graph.getEdgeWeight(u, v) });
+      removedEdges.push({
+        u,
+        v,
+        weight: graph.getEdgeWeight(u, v),
+        props: graph.getEdgeProperties(u, v),
+      });
       graph.removeEdge(u, v);
     }
 
     if (graph.hasEdge(v, u)) {
-      removedEdges.push({ u: v, v: u, weight: graph.getEdgeWeight(v, u) });
+      removedEdges.push({
+        u: v,
+        v: u,
+        weight: graph.getEdgeWeight(v, u),
+        props: graph.getEdgeProperties(u, v),
+      });
       graph.removeEdge(v, u);
     }
 
@@ -38,8 +48,8 @@ export function shortestPaths<Node>(
     }
   }
 
-  for (const { u, v, weight } of removedEdges) {
-    graph.addEdge(u, v, weight);
+  for (const { u, v, weight, props } of removedEdges) {
+    graph.addEdge(u, v, ...([weight, props] as never));
   }
 
   return paths;