I want to iterate through the vertices of a graph, but the graph type does not have that method, and visiting each one using DFS does not work since, during runtime, I have vertices with no edges connected. Even if I had, I could only iterate through edges and then access Vertices, using the method...

The new ToplogicalSort(), based on its StableTopologicalSort(), has really large performance degradation. A program that used to take 42s, now takes 220-300s (sometimes more), with the vast majority of the time in StableToplogicalSort(). The current usage is the OSS wolfictl, but I will try to creat...

The current DFS and BFS methods require a starting vertex as an argument and will only visit vertices that are reachable from these starting vertices. There should be separate methods that don't take such an argument and traverse all vertices in the graph, even if the graph is disconnected. Maybe, a...

Hi :) This is a discussion. While TopologicalSort is the appropriate API for our needs, it has a limitation in that the depth information of the nodes cannot be easily represented by a single slice. This can make it challenging to determine which nodes belong to which level after obtaining the sorte...

我希望将 README.md 翻译成简体中文。翻译应该包含与原始文档相同的示例和内容。我的中文水平太差了，所以任何帮助都将不胜感激。

graph has graph.EdgeAttribute(string, string) graph.EdgeAttributes(map[string] string) But for Vertex it only has graph.VertixAttribute(string, string) Which means that each vertex option for dot has to be added with a separate call.

It is often convenient to give some default options for graph, nodes and edges, as in: strict digraph { graph [bgcolor = gray10, fontcolor = white, fontname = "Arial"] node [shape = circle, color = green4, style = filled, fillcolor = cadetblue1, fontname = "Arial", fontsize=12, fixedsize=fal...

At the moment, a cloned graph uses the same Store instance as the original graph. Proof: func TestClonedGraph(t *testing.T) { g := graph.New(graph.IntHash) _ = g.AddVertex(1) _ = g.AddVertex(2) _ = g.AddVertex(3) h, _ := g.Clone() _ = h.AddVertex(4) _, err := g.Vertex(4) if !errors.Is(er...

At the moment, the built-in in-memory store implementation that satisfies the Store interface stores the edge properties multiple times: In outEdges and in inEdges, because both store full Edge[K] instances. This isn't memory-efficient for edges that store a lot of data. Therefore, it might make sen...

There should be a method for updating an edge, for example UpdateEdge[K comparable](source, target K, options ...func(*EdgeProperties)) error. The API should be exactly the same as for AddEdge, so that the user can use the existing functional options for setting the edge properties.