update go package

farischt · Jan 16, 2023 · a34659f · a34659f
1 parent 63cc6ab
commit a34659f
Show file tree

Hide file tree

Showing 4 changed files with 10 additions and 7 deletions.
diff --git a/go.mod b/go.mod
@@ -1,3 +1,3 @@
-module ds
+module github.com/farischt/ds
 
 go 1.19
diff --git a/graph/main.go b/graph/main.go
@@ -1,9 +1,10 @@
 package graph
 
 import (
-	"ds/queue"
-	"ds/stack"
 	"fmt"
+
+	"github.com/farischt/ds/queue"
+	"github.com/farischt/ds/stack"
 )
 
 type IGraph[T comparable] interface {
@@ -215,6 +216,7 @@ func (g *Graph[T]) LargestComponentSize() int {
 	return maxSize
 }
 
+// Type element used to store the node and the distance from the source.
 type Element[T any] struct {
 	node     T
 	distance int

diff --git a/main.go b/main.go
@@ -1,10 +1,10 @@
-package main
+package ds
 
 import (
 	"fmt"
 )
 
-func main() {
+func Main() {
 	fmt.Println(`
 ██╗    ██╗███████╗██╗      ██████╗ ██████╗ ███╗   ███╗███████╗    ████████╗ ██████╗ 
 ██║    ██║██╔════╝██║     ██╔════╝██╔═══██╗████╗ ████║██╔════╝    ╚══██╔══╝██╔═══██╗

diff --git a/tree/bst.go b/tree/bst.go
@@ -1,9 +1,10 @@
 package tree
 
 import (
-	"ds/queue"
-	"ds/stack"
 	"fmt"
+
+	"github.com/farischt/ds/queue"
+	"github.com/farischt/ds/stack"
 )
 
 type IBinarySearchTree interface {