refactored code

rajatgupta310198 · Sep 14, 2020 · fa1f46e · fa1f46e
1 parent 8d9adf1
commit fa1f46e
Show file tree

Hide file tree

Showing 17 changed files with 56 additions and 32 deletions.
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/main.go b/main.go
@@ -2,8 +2,8 @@ package main
 
 // import formatted I/O package
 import (
-	"algos/src/Algo/other/permutaions"
-	"algos/src/Algo/search/graph"
+	"algos/src/Other/permutaions"
+	"algos/src/graph"
 	"fmt"
 )
 

diff --git a/src/Algo/search/Binary/binary_search.go → src/Binary/binary_search.go b/src/Algo/search/Binary/binary_search.go → src/Binary/binary_search.go
diff --git a/src/Algo/search/Binary/binary_test.go → src/Binary/binary_test.go b/src/Algo/search/Binary/binary_test.go → src/Binary/binary_test.go
diff --git a/src/Algo/search/Jump/jump_search.go → src/Jump/jump_search.go b/src/Algo/search/Jump/jump_search.go → src/Jump/jump_search.go
diff --git a/src/Algo/search/Jump/jump_test.go → src/Jump/jump_test.go b/src/Algo/search/Jump/jump_test.go → src/Jump/jump_test.go
diff --git a/.../other/permutaions/factorial_recursive.go → src/Other/permutaions/factorial_recursive.go b/.../other/permutaions/factorial_recursive.go → src/Other/permutaions/factorial_recursive.go
diff --git a/...go/other/permutaions/heaps_permutation.go → src/Other/permutaions/heaps_permutation.go b/...go/other/permutaions/heaps_permutation.go → src/Other/permutaions/heaps_permutation.go
diff --git a/...lgo/other/permutaions/permutation_test.go → src/Other/permutaions/permutation_test.go b/...lgo/other/permutaions/permutation_test.go → src/Other/permutaions/permutation_test.go
diff --git a/...ther/positive-integer/fin_min_positive.go → ...ther/positive-integer/fin_min_positive.go b/...ther/positive-integer/fin_min_positive.go → ...ther/positive-integer/fin_min_positive.go
diff --git a/...o/other/positive-integer/positive_test.go → src/Other/positive-integer/positive_test.go b/...o/other/positive-integer/positive_test.go → src/Other/positive-integer/positive_test.go
diff --git a/src/graph/dfs.go b/src/graph/dfs.go
@@ -0,0 +1,30 @@
+package graph
+
+import (
+	"fmt"
+	)
+
+// Dfs performs Depth Fist Search
+func (g *Graph) Dfs(vertex *Vertex) {
+	//visited := []bool{false, false}
+
+	visited := make(map[string]bool)
+	for i := range g.Vertices {
+		visited[g.Vertices[i].Label] = false
+	}
+	g.dfsUtil(vertex, visited)
+
+}
+
+// dfsUtil is utility for Dfs
+func (g *Graph) dfsUtil(vertex *Vertex, visited map[string]bool) {
+
+	visited[vertex.Label] = true
+	fmt.Printf("\n%s ", vertex.Label)
+	for _, v := range vertex.AdjList {
+		if visited[v.Label] == false {
+			g.dfsUtil(v, visited)
+		}
+	}
+
+}
diff --git a/src/Algo/search/graph/graph.go → src/graph/graph.go b/src/Algo/search/graph/graph.go → src/graph/graph.go
@@ -1,5 +1,6 @@
 package graph
 
+
 import (
 	"fmt"
 )
@@ -35,32 +36,6 @@ func (g *Graph) AddEdge(srcVertex, dstVertex *Vertex) *Vertex {
 	srcVertex.AdjList = append(srcVertex.AdjList, dstVertex)
 	return srcVertex
 }
-
-// Dfs performs Depth Fist Search
-func (g *Graph) Dfs(vertex *Vertex) {
-	//visited := []bool{false, false}
-
-	visited := make(map[string]bool)
-	for i := range g.Vertices {
-		visited[g.Vertices[i].Label] = false
-	}
-	g.dfsUtil(vertex, visited)
-
-}
-
-// dfsUtil is utility for Dfs
-func (g *Graph) dfsUtil(vertex *Vertex, visited map[string]bool) {
-
-	visited[vertex.Label] = true
-	fmt.Printf("\n%s ", vertex.Label)
-	for _, v := range vertex.AdjList {
-		if visited[v.Label] == false {
-			g.dfsUtil(v, visited)
-		}
-	}
-
-}
-
 // PrintGraph prints the create graph G
 func (g *Graph) PrintGraph() {
 	fmt.Printf("Number of vertices %d\n", g.VertexCount)

diff --git a/src/Algo/search/graph/graph_test.go → src/graph/graph_test.go b/src/Algo/search/graph/graph_test.go → src/graph/graph_test.go
diff --git a/src/DS/tree/bst/bst.go → src/tree/bst/bst.go b/src/DS/tree/bst/bst.go → src/tree/bst/bst.go
diff --git a/src/DS/tree/bst/bst_test.go → src/tree/bst/bst_test.go b/src/DS/tree/bst/bst_test.go → src/tree/bst/bst_test.go
diff --git a/src/DS/tree/main.go → src/tree/main.go b/src/DS/tree/main.go → src/tree/main.go
@@ -1,12 +1,12 @@
 package main
 
 import (
-	"../tree/bst"
+	bst2 "algos/src/tree/bst"
 	"fmt"
 )
 
 func main()  {
-	b := new(bst.T)
+	b := new(bst2.T)
 	//b.Insert(1)
 	a := [] int {1, 2, 3, 7, 4, 5, 9, 6, 12, 15}
 	for i :=range a {