Rename Graph interfaces for specificity

Author: another-guy

src/practice/0-directed-graph.ts

@@ -1,4 +1,4 @@
-export interface IGraph {
+export interface IDirectedGraph {
   nodes: string[];
   edges: { [ source: string ]: string[] };
 }

src/practice/0-undirected-graph.ts

@@ -4,7 +4,7 @@ export interface IEdge {
   distance: number;
 }
 
-export interface IGraph {
+export interface IUndirectedGraph {
   nodes: string[];
   edges: IEdge[];
 }

src/practice/1-1-top-sort.ts

@@ -1,7 +1,7 @@
-import { IGraph } from './0-directed-graph';
+import { IDirectedGraph } from './0-directed-graph';
 
 export function topSort(
-  graph: IGraph,
+  graph: IDirectedGraph,
 ): string[] {
   const ordered: string[] = [];
   const notVisited = new Set(graph.nodes);
@@ -39,7 +39,7 @@ export function nodesWithoutIncomingEdges(
 
 export function isTopSort(
   orderedNodes: string[],
-  graph: IGraph,
+  graph: IDirectedGraph,
 ): boolean {
   if (graph.nodes.length !== (orderedNodes || []).length) return false;
 
@@ -53,7 +53,7 @@ export function isTopSort(
   return true;
 }
 
-export function pathExists(source: string, destination: string, graph: IGraph): boolean {
+export function pathExists(source: string, destination: string, graph: IDirectedGraph): boolean {
   const toVisit = [source];
   const visited = new Set<string | undefined>([]);
 

src/practice/1-2-dijkstra-shortest-path.ts

@@ -1,4 +1,4 @@
-import { IGraph } from './0-undirected-graph';
+import { IUndirectedGraph } from './0-undirected-graph';
 
 const infinity = Number.POSITIVE_INFINITY;
 
@@ -17,7 +17,7 @@ export interface IPath {
 }
 
 export function dijkstraShortestPath(
-  graph: IGraph,
+  graph: IUndirectedGraph,
   sourceNode: string,
   destinationNode: string,
 ): IPath {