Merge pull request #372 from BrianLusina/feat/graphs

Graphs | Vertex & Graph Data Structures

Author: BrianLusina

DIRECTORY.md

@@ -116,8 +116,6 @@
   * circular-buffer
     * [circular-buffer](https://github.com/BrianLusina/jtscripts/blob/master/datastructures/circular-buffer/circular-buffer.js)
     * [circular-buffer](https://github.com/BrianLusina/jtscripts/blob/master/datastructures/circular-buffer/circular-buffer.spec.js)
-  * Graphs
-    * [devbook](https://github.com/BrianLusina/jtscripts/blob/master/datastructures/Graphs/devbook.js)
   * hashmap
     * [HashMapJs](https://github.com/BrianLusina/jtscripts/blob/master/datastructures/hashmap/HashMapJs.js)
   * linkedlist

…tructures/Graphs/findTownJudge/README.md algorithms/graphs/findTownJudge/README.mddatastructures/Graphs/findTownJudge/README.md renamed to algorithms/graphs/findTownJudge/README.md datastructures/Graphs/findTownJudge/README.md renamed to algorithms/graphs/findTownJudge/README.md

@@ -1,4 +1,3 @@
-Relevant Links
+# Graphs
 
-https://medium.freecodecamp.com/a-gentle-introduction-to-data-structures-how-graphs-work-a223d9ef8837#.4gl51zy2x
-https://www.tutorialspoint.com/data_structures_algorithms/graph_data_structure.htm
+Data structures representing graphs

…ctures/Graphs/findTownJudge/townJudge.ts …rithms/graphs/findTownJudge/townJudge.tsdatastructures/Graphs/findTownJudge/townJudge.ts renamed to algorithms/graphs/findTownJudge/townJudge.ts datastructures/Graphs/findTownJudge/townJudge.ts renamed to algorithms/graphs/findTownJudge/townJudge.ts

@@ -0,0 +1,23 @@
+export default class Vertex<T> {
+  private id: string;
+  private data: T;
+  private metadata: Map<string, unknown> | undefined;
+  private adjacentVertices: Map<string, Vertex<T>>;
+
+  constructor(id: string, data: T, metadata: Map<string, unknown> | undefined) {
+    this.id = id;
+    this.data = data;
+    this.metadata = metadata;
+    this.adjacentVertices = new Map<string, Vertex<T>>();
+  }
+
+  addAdjacentVertex(vertex: Vertex<T>) {
+    if (!this.adjacentVertices.has(vertex.id)) {
+      // add adjacent vertex given ID, if this vertex does not exist
+      this.adjacentVertices.set(vertex.id, vertex);
+
+      // add this vertex as a neighbour
+      vertex.addAdjacentVertex(this);
+    }
+  }
+}