diff --git a/YASI_12/YASI_12.vcxproj b/YASI_12/YASI_12.vcxproj
index 89e2516..e1c21bf 100644
--- a/YASI_12/YASI_12.vcxproj
+++ b/YASI_12/YASI_12.vcxproj
@@ -84,6 +84,7 @@
     <ClInclude Include="ds.comparable.h" />
     <ClInclude Include="ds.dictionary.h" />
     <ClInclude Include="ds.doublylinkedlist.h" />
+    <ClInclude Include="ds.graph.h" />
     <ClInclude Include="ds.hashtablebase.h" />
     <ClInclude Include="ds.HopScotchHashTable.h" />
     <ClInclude Include="ds.IntLinearProbingHashTable.h" />
diff --git a/YASI_12/YASI_12.vcxproj.filters b/YASI_12/YASI_12.vcxproj.filters
index 5d40c3d..5367086 100644
--- a/YASI_12/YASI_12.vcxproj.filters
+++ b/YASI_12/YASI_12.vcxproj.filters
@@ -31,6 +31,9 @@
     <Filter Include="Header Files\Common">
       <UniqueIdentifier>{d2827f3c-736f-4f2a-891c-9fa2883e5685}</UniqueIdentifier>
     </Filter>
+    <Filter Include="Header Files\Graph">
+      <UniqueIdentifier>{9d029d58-d806-4503-8f54-cc27d0b9332d}</UniqueIdentifier>
+    </Filter>
   </ItemGroup>
   <ItemGroup>
     <ClCompile Include="main.cpp">
@@ -128,5 +131,8 @@
     <ClInclude Include="ds.HopScotchHashTable.h">
       <Filter>Header Files\Dictionary</Filter>
     </ClInclude>
+    <ClInclude Include="ds.graph.h">
+      <Filter>Header Files\Graph</Filter>
+    </ClInclude>
   </ItemGroup>
 </Project>
\ No newline at end of file
diff --git a/YASI_12/ds.graph.h b/YASI_12/ds.graph.h
new file mode 100644
index 0000000..a640dde
--- /dev/null
+++ b/YASI_12/ds.graph.h
@@ -0,0 +1,49 @@
+#pragma once
+#include "common.h"
+#include "ds.doublylinkedlist.h"
+using namespace std;
+
+namespace yasi{
+namespace ds{
+
+// forward declarations
+class VertexBase;
+class EdgeBase;
+
+template<class V, class Element>
+struct Edge{
+	Element element;
+	V *pStart, *pEnd;
+};
+
+template<class E>
+typedef DoublyLinkedList< E > EdgeList;
+
+template<class Element, class EdgeElement>
+struct Vertex{
+protected:
+	typedef Vertex<Element, EdgeElement> self;
+	typedef Edge<self, EdgeElement> edge;
+public:	
+	typedef DoublyLinkedList< edge > EdgeList;
+	int id;
+	Element element;
+	EdgeList* pInEdges;
+	EdgeList* pOutEdges;
+};
+
+/// Adjacency list data structure
+template<class VertexElement, class EdgeElement>
+class Graph{
+public:
+	typedef Vertex<VertexElement, EdgeElement> VertexType;
+	typedef Edge<VertexType, EdgeElement> EdgeType;
+	typedef DoublyLinkedList<VertexType*> VertexList;
+	typedef DoublyLinkedList<EdgeType*> EdgeList;
+protected:
+	VertexList* vertexList;
+	EdgeList*	edgeList;
+};
+
+}
+}
\ No newline at end of file