diff --git a/Data Structures/Graph/Undirected Graph/UndirectedGraphAdjacenyList.cpp b/Data Structures/Graph/Undirected Graph/UndirectedGraphAdjacenyList.cpp
new file mode 100644
index 0000000..09a302a
--- /dev/null
+++ b/Data Structures/Graph/Undirected Graph/UndirectedGraphAdjacenyList.cpp	
@@ -0,0 +1,31 @@
+#include<iostream>
+#include<list>
+#include<vector>
+#include<iterator>
+#define Max 10
+using namespace std;
+list<int> g[Max];
+void addEdge(int u,int v){
+	g[u].push_back(v);
+	g[v].push_back(u);
+	
+}
+
+void print(){
+	list<int>::iterator ptr;
+	for(int i=1;i<Max;i++){
+		cout<<i<<"->";
+		for(ptr=g[i].begin();ptr!=g[i].end();ptr++){
+			cout<<*ptr<<" ";
+		}
+		cout<<endl;
+	}
+}
+int main(){
+	addEdge(1,2);
+	addEdge(2,6);
+	addEdge(3,5);
+	addEdge(5,6);
+	print();
+	return 0;
+}
diff --git a/Data Structures/Graph/Undirected Graph/UndirectedGraphMatrix.cpp b/Data Structures/Graph/Undirected Graph/UndirectedGraphMatrix.cpp
new file mode 100644
index 0000000..4849aaf
--- /dev/null
+++ b/Data Structures/Graph/Undirected Graph/UndirectedGraphMatrix.cpp	
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+#define Max 10
+int graph[Max][Max];
+void addEdge(int u,int v){
+	graph[u][v]=1;
+	graph[v][u]=1;
+}
+
+void prints(){
+	cout<<"   ";
+	for(int j=1;j<Max;j++){
+			cout<<j<<" ";
+		}
+		cout<<endl;
+	for(int i=1;i<Max;i++){
+		cout<<i<<"  ";
+		for(int j=1;j<Max;j++){
+			cout<<graph[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+}
+int main(){
+
+	
+	addEdge(1,2);
+    addEdge(3,2);
+    addEdge(3,4);
+    addEdge(4,2);
+    addEdge(4,5);
+    addEdge(5,2);
+    addEdge(5,1);
+    prints();
+	return 0;
+}
diff --git a/String Algorithms/String Matching/Boyer-MooreHorspoolAlgorithm.py b/String Algorithms/String Matching/Boyer-MooreHorspoolAlgorithm.py
new file mode 100644
index 0000000..54b9913
--- /dev/null
+++ b/String Algorithms/String Matching/Boyer-MooreHorspoolAlgorithm.py	
@@ -0,0 +1,48 @@
+import os
+
+CHAR=256
+
+def badCharacterTable(pattern):
+    length=len(pattern)
+    badchar=[length]*CHAR
+    
+    for i in range(length-1):
+        badchar[ord(pattern[i])]=length-i
+    
+    return badchar
+
+def stringSearch(text,pattern):
+    textlen=len(text)
+    patternlen=len(pattern)
+    badchar=badCharacterTable(pattern)    
+    occurance=[]
+    position=0
+    if(text=="" or pattern==""):
+        print("Text:"+text+"\nPattern:"+pattern+"\nTotal Number matched:"+str(len(occurance))+"\nPositions matched:"+', '.join(occurance))
+        return
+    
+    while(position<=(textlen-patternlen)):
+        j=patternlen-1
+        while(j>=0 and (text[position+j]==pattern[j] or pattern[j]=='_')):
+            j=j-1
+            
+        if(j==-1):
+            occurance.append(str(position+1))
+            position=position+1
+        else:
+            position=position+ max(1,j-badchar[ord(text[position+j])])
+    print("Text:"+text+"\nPattern:"+pattern+"\nTotal Number matched:"+str(len(occurance))+"\nPositions matched:"+', '.join(occurance))
+        
+def main():
+    while (1):
+        text=input("Enter a sample text:")
+        pattern=input("Enter a pattern:")
+        stringSearch(text,pattern)
+        print("\nEnter 1 to test Continue\nEnter 0 to EXIT")
+        n=input("Enter your choise: ")
+        if(n=='0'):
+            return
+
+
+if __name__=="__main__":
+    main()