Now that the Store interface is available, it should be clarified which and what kind of errors should be returned by its implementations. Example: AddEdge adds a new edge. Should the store return ErrEdgeAlready exists if the edge already exists, or should the Graph implementation check this in adva...

Hi, as I see in https://github.com/dominikbraun/graph/blob/main/draw/draw.go current logic doesn't contains possibility to add graph attributes. Example: strict digraph { rankdir="LR"; dpi="200.0"; "a" [ weight=0 ]; "b" [ weight=0 ]; "a" -> "b" [ weight=0 ]; } I mean rankdir and dpi...

The golangci-lint configuration in graph's CI pipeline checks for gofumpt. I don't like it. The very purpose of gofmt is to provide an official, unified formatting for all Go projects, and gofumpt pretty much defeats this purpose. If you format your code with gofmt, the pipeline may still fail becau...

This question is from advent of code Day 12 part 1. https://adventofcode.com/2022/day/12 Problem The heightMap is a 2d array with shape [41 143], when I create a graph and input all the data, ShortestPath returns a path that looks to be semi random, ranging from 500 to 600. After this failed I impli...

All unit tests should use subtests. That is, calling the entire testing logic inside t.Run.

This is a v1.0 feature. As long as graph is in version 0, it must not be implemented. To enable #66, the function signature of New has to look as follows: func New[K comparable, T any](hash Hash[K, T], options ...func(*Properties)) Graph[K, T]

This is a v1.0 feature. As long as graph is in version 0, it must not be implemented. At the moment, there are Traits and Properties. Traits contains graph traits such as IsDirected, and Properties contains dynamic graph properties such as Attributes. These two types shall be unified in a new Proper...

In situations with a fixed starting vertex and a number of different target vertices, calling ShortestPath for all of these vertices is quite expensive. Because ShortestPath already computes the cost of reaching a vertex from the start for all vertices in the graph, the algorithm can possibly easily...

func DrawGraph() { // new a graph g := graph.New(graph.StringHash, graph.Directed()) // add vertexes for vertex := range file2index { g.AddVertex(vertex, graph.VertexWeight(5)) } for i := 0; i < fileAmount; i++ { forer...

Can anyone tell me how to fix this problem?