feat: add method that returns all vertices

directed.go

@@ -75,6 +75,10 @@ func (d *directed[K, T]) RemoveVertex(hash K) error {
 	return d.store.RemoveVertex(hash)
 }
 
+func (d *directed[K, T]) Vertices() map[K]T {
+	return d.store.AllVertices()
+}
+
 func (d *directed[K, T]) AddEdge(sourceHash, targetHash K, options ...func(*EdgeProperties)) error {
 	_, _, err := d.store.Vertex(sourceHash)
 	if err != nil {

graph.go

@@ -99,6 +99,9 @@ type Graph[K comparable, T any] interface {
 	// be returned. If the vertex doesn't exist, ErrVertexNotFound is returned.
 	RemoveVertex(hash K) error
 
+	// Vertices returns a copy of all vertices as map
+	Vertices() map[K]T
+
 	// AddEdge creates an edge between the source and the target vertex.
 	//
 	// If either vertex cannot be found, ErrVertexNotFound will be returned. If

store.go

@@ -2,6 +2,7 @@ package graph
 
 import (
 	"fmt"
+	"maps"
 	"sync"
 )
 
@@ -25,6 +26,9 @@ type Store[K comparable, T any] interface {
 	// ErrVertexHasEdges should be returned.
 	RemoveVertex(hash K) error
 
+	// AllVertices returns a map, containing all vertices
+	AllVertices() map[K]T
+
 	// ListVertices should return all vertices in the graph in a slice.
 	ListVertices() ([]K, error)
 
@@ -75,8 +79,8 @@ type memoryStore[K comparable, T any] struct {
 
 	// outEdges and inEdges store all outgoing and ingoing edges for all vertices. For O(1) access,
 	// these edges themselves are stored in maps whose keys are the hashes of the target vertices.
-	outEdges map[K]map[K]Edge[K] // source -> target
-	inEdges  map[K]map[K]Edge[K] // target -> source
+	outEdges  map[K]map[K]Edge[K] // source -> target
+	inEdges   map[K]map[K]Edge[K] // target -> source
 	edgeCount int
 }
 
@@ -103,6 +107,16 @@ func (s *memoryStore[K, T]) AddVertex(k K, t T, p VertexProperties) error {
 	return nil
 }
 
+func (s *memoryStore[K, T]) AllVertices() map[K]T {
+	out := make(map[K]T, len(s.vertices))
+	s.lock.RLock()
+	defer s.lock.RUnlock()
+
+	maps.Copy(out, s.vertices)
+
+	return out
+}
+
 func (s *memoryStore[K, T]) ListVertices() ([]K, error) {
 	s.lock.RLock()
 	defer s.lock.RUnlock()

undirected.go

@@ -56,6 +56,10 @@ func (u *undirected[K, T]) RemoveVertex(hash K) error {
 	return u.store.RemoveVertex(hash)
 }
 
+func (u *undirected[K, T]) Vertices() map[K]T {
+	return u.store.AllVertices()
+}
+
 func (u *undirected[K, T]) AddEdge(sourceHash, targetHash K, options ...func(*EdgeProperties)) error {
 	if _, _, err := u.store.Vertex(sourceHash); err != nil {
 		return fmt.Errorf("could not find source vertex with hash %v: %w", sourceHash, err)