added algorithms

Author: BuildTools

README.md

@@ -1 +1,11 @@
 # Algorithms
+INCLUDES
+
+MergeSort
+InsertionSort
+QuickSort
+
+Graph Algorithms:
+Kruskal's Algorithm (undirected)
+Prim's Algorithm (undirected)
+Dijkstra's Algorithm (undirected)

graphParseAndPlotUndirected/__pycache__/graph.cpython-36.pyc

@@ -0,0 +1,40 @@
+'''
+Created on Nov 8, 2014
+
+@author: Gary
+'''
+
+class graph:
+    def __init__(self):
+        self.vertexNameArray       = [] # vertex names in an array
+        self.vertexIndexMap        = {} # vertex names to index dictionary
+        self.vertexPositionArray   = [] # x,y pair position array
+        self.edgeArray             = [] # array of (vertex index pair, weight)
+    
+    def addVertex(self, name, x, y):
+        self.vertexIndexMap[name] = self.vCount()
+        self.vertexNameArray.append(name)
+        self.vertexPositionArray.append((x,y))
+        
+    def addEdge(self, vName1, vName2, weight):
+        self.edgeArray.append((self.vertexIndexMap[vName1],self.vertexIndexMap[vName2],weight))
+        
+    def newEdgeWeight(self, i_edge, new_weight):
+        self.edgeArray[i_edge][2] = new_weight
+        
+    def vCount(self): return len(self.vertexNameArray)
+    
+    def eCount(self): return len(self.edgeArray)
+    
+    # Access functions for vertex information
+    def  vX(   self, i): return self.vertexPositionArray[i][0]
+    def  vY(   self, i): return self.vertexPositionArray[i][1]
+    def  vName(self, i): return self.vertexNameArray[i]
+    def  vIndx(self, v): return self.vertexIndexMap[v]
+    
+    # Access functions for edge information
+    def  eV0X( self, i): return self.vertexPositionArray[self.edgeArray[i][0]][0]
+    def  eV0Y( self, i): return self.vertexPositionArray[self.edgeArray[i][0]][1]
+    def  eV1X( self, i): return self.vertexPositionArray[self.edgeArray[i][1]][0]
+    def  eV1Y( self, i): return self.vertexPositionArray[self.edgeArray[i][1]][1]
+    def  eWght(self, i): return self.edgeArray[i][2]

graphParseAndPlotUndirected/graph.py

@@ -0,0 +1,7 @@
+a 20   30
+b 200  40
+c 30  350
+----------
+a b 3
+b c 4
+a c 5

graphParseAndPlotUndirected/graph.txt

@@ -0,0 +1,23 @@
+a 20   30
+b 200  40
+c 30  350
+d 350 380
+e 100 300
+f 340  25
+g 200 250
+----------
+a b 3
+b c 4
+a c 5
+a d 4
+b d 2
+c d 1
+e a 2
+a f 5
+e c 3
+e d 3
+d f 2
+e g 1
+b g 2
+d g 3
+b f 2

graphParseAndPlotUndirected/graph1.txt

@@ -0,0 +1,39 @@
+a 20   30
+b 100  40
+c 30  250
+d 60  130
+e 150  90
+f 240  60
+g 120 200
+h 200 160
+i 260 100
+j 360 400
+l 180 350
+m 280 300
+n 80  350
+o 350  40
+----------
+a b 3
+a c 2
+a d 5
+b c 4
+b d 1
+b g 2
+c d 7
+c g 5
+e f 4
+e g 3
+e h 2
+f h 3
+f i 4
+g l 1
+g n 1
+h i 1
+h m 3
+i m 2
+i o 2
+j l 7
+j m 3
+j o 4
+l m 5
+l n 6

graphParseAndPlotUndirected/graph2.txt

@@ -0,0 +1,24 @@
+a 10 100
+b 100 200
+c 200 200
+d 300 200
+e 390 100
+f 300 10
+g 200 10
+h 100 10
+i 150 100
+----------
+a b 4
+b c 8
+b h 11
+a h 8
+h i 7
+h g 1
+i c 2
+i g 6
+c f 4
+g f 2
+c d 7
+d e 9
+d f 14
+e f 10