.

collections/graph/topologicalsort.go

@@ -0,0 +1,27 @@
+package graph
+
+import "github.com/lorenzotinfena/goji/utils/slices"
+
+// Assumptions:
+// - the graph is acyclic
+func TopologicalSort[V any](vertices []V, adjacents func(V) []V, setAdd func(V), setContains func(V) bool) []V {
+	res := []V{}
+
+	var dfs func(v V)
+	dfs = func(v V) {
+		setAdd(v)
+		for _, v1 := range adjacents(v) {
+			if !setContains(v1) {
+				dfs(v1)
+			}
+		}
+		res = append(res, v)
+	}
+	for _, v := range vertices {
+		if !setContains(v) {
+			dfs(v)
+		}
+	}
+	slices.Reverse(res)
+	return res
+}

collections/linkedlist/circulardoubly.go

@@ -25,6 +25,7 @@ func NewCircularDoublyLinkedList[T any](equals func(T, T) bool) *CircularDoublyL
 		equals: equals,
 	}
 }
+
 func (l *CircularDoublyLinkedList[T]) Len() int { return l.length }
 
 func (l *CircularDoublyLinkedList[T]) First() T { return l.first.Value }

collections/linkedlist/singly.go

@@ -27,6 +27,7 @@ func NewSinglyLinkedList[T any](equals func(T, T) bool) *SinglyLinkedList[T] {
 		equals: equals,
 	}
 }
+
 func (l *SinglyLinkedList[T]) Len() int { return l.length }
 
 func (l *SinglyLinkedList[T]) First() T { return l.first.Value }