Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/dominikbraun/graph
/ functions
Functions
245 in github.com/dominikbraun/graph
⨍
Functions
245
◇
Types & classes
24
↓ 1 callers
Function
predecessors
(g *directed[K, T], vertexHash K)
directed_test.go:1434
↓ 1 callers
Function
slicesAreEqual
(a, b []T, equals func(a, b T) bool)
draw/draw_test.go:400
↓ 1 callers
Function
slicesAreEqualWithFunc
(a, b []T, equals func(a, b T) bool)
dag_test.go:306
↓ 1 callers
Method
top
()
collection.go:144
Method
AddEdge
(sourceHash, targetHash K, edge Edge[K])
store.go:162
Method
AddEdge
AddEdge creates an edge between the source and the target vertex. If either vertex cannot be found, ErrVertexNotFound will be returned. If the edge a
graph.go:114
Method
AddEdgesFrom
(g Graph[K, T])
directed.go:119
Method
AddEdgesFrom
(g Graph[K, T])
undirected.go:103
Method
AddVertex
(k K, t T, p VertexProperties)
store.go:87
Method
AddVertex
AddVertex creates a new vertex in the graph. If the vertex already exists in the graph, ErrVertexAlreadyExists will be returned. AddVertex accepts a
graph.go:78
Method
AddVerticesFrom
(g Graph[K, T])
directed.go:40
Method
AddVerticesFrom
(g Graph[K, T])
undirected.go:118
Method
Clone
()
directed.go:245
Method
Clone
()
undirected.go:284
Function
DOT
DOT renders the given graph structure in DOT language into an io.Writer, for example a file. The generated output can be passed to Graphviz or other v
draw/draw.go:73
Method
Edge
Edge returns the edge joining two given vertices or ErrEdgeNotFound if the edge doesn't exist. In an undirected graph, an edge with swapped source and
graph.go:127
Method
Edges
()
directed.go:161
Method
Edges
()
undirected.go:176
Method
Len
Len returns the total number of items in the priority queue.
collection.go:31
Method
Less
(i, j int)
collection.go:86
Method
ListEdges
()
store.go:221
Method
ListVertices
()
store.go:101
Method
Order
()
directed.go:271
Method
Order
()
undirected.go:309
Method
Pop
Pop returns and removes the item with the lowest priority. This operation may cause a re-balance of the heap and thus scales with O(log n).
collection.go:54
Method
PredecessorMap
()
directed.go:214
Method
PredecessorMap
()
undirected.go:280
Method
Push
Push pushes a new item with the given priority into the queue. This operation may cause a re-balance of the heap and thus scales with O(log n).
collection.go:37
Method
RemoveEdge
(source, target K)
directed.go:178
Method
RemoveEdge
(source, target K)
undirected.go:240
Method
RemoveEdge
(sourceHash, targetHash K)
store.go:195
Method
RemoveEdge
RemoveEdge removes the edge between the given source and target vertices. If the edge cannot be found, ErrEdgeNotFound will be returned.
graph.go:152
Method
RemoveVertex
(hash K)
directed.go:74
Method
RemoveVertex
(hash K)
undirected.go:55
Method
RemoveVertex
(k K)
store.go:134
Method
RemoveVertex
RemoveVertex removes the vertex with the given hash value from the graph. The vertex is not allowed to have edges and thus must be disconnected. Pote
graph.go:100
Method
Size
()
directed.go:275
Method
Size
()
undirected.go:313
Method
Swap
(i, j int)
collection.go:90
Function
TestAcyclic
(t *testing.T)
traits_test.go:27
Function
TestAllPathsBetween
(t *testing.T)
paths_test.go:502
Function
TestDirected
(t *testing.T)
traits_test.go:5
Function
TestDirectedBFS
(t *testing.T)
traversal_test.go:246
Function
TestDirectedCreatesCycle
(t *testing.T)
paths_test.go:9
Function
TestDirectedDFS
(t *testing.T)
traversal_test.go:8
Function
TestDirectedMaximumSpanningTree
(t *testing.T)
trees_test.go:112
Function
TestDirectedMinimumSpanningTree
(t *testing.T)
trees_test.go:7
Function
TestDirectedShortestPath
(t *testing.T)
paths_test.go:161
Function
TestDirectedStableTopologicalSort
(t *testing.T)
dag_test.go:100
Function
TestDirectedStronglyConnectedComponents
(t *testing.T)
paths_test.go:418
Function
TestDirectedTopologicalSort
(t *testing.T)
dag_test.go:8
Function
TestDirectedTransitiveReduction
(t *testing.T)
dag_test.go:183
Function
TestDirectedUnion
(t *testing.T)
sets_test.go:7
Function
TestDirected_AddEdge
(t *testing.T)
directed_test.go:304
Function
TestDirected_AddEdgesFrom
(t *testing.T)
directed_test.go:457
Function
TestDirected_AddVertex
(t *testing.T)
directed_test.go:33
Function
TestDirected_AddVerticesFrom
(t *testing.T)
directed_test.go:121
Function
TestDirected_AdjacencyList
(t *testing.T)
directed_test.go:919
Function
TestDirected_Clone
(t *testing.T)
directed_test.go:1086
Function
TestDirected_Edge
(t *testing.T)
directed_test.go:602
Function
TestDirected_Edges
(t *testing.T)
directed_test.go:680
Function
TestDirected_OrderAndSize
(t *testing.T)
directed_test.go:1154
Function
TestDirected_PredecessorMap
(t *testing.T)
directed_test.go:1003
Function
TestDirected_RemoveEdge
(t *testing.T)
directed_test.go:853
Function
TestDirected_RemoveVertex
(t *testing.T)
directed_test.go:254
Function
TestDirected_Traits
(t *testing.T)
directed_test.go:8
Function
TestDirected_UpdateEdge
(t *testing.T)
directed_test.go:786
Function
TestDirected_Vertex
(t *testing.T)
directed_test.go:214
Function
TestDirected_addEdge
(t *testing.T)
directed_test.go:1253
Function
TestDirected_edgesAreEqual
(t *testing.T)
directed_test.go:1226
Function
TestDirected_predecessors
(t *testing.T)
directed_test.go:1289
Function
TestEdgeAttribute
(t *testing.T)
graph_test.go:160
Function
TestEdgeAttributes
(t *testing.T)
graph_test.go:200
Function
TestEdgeWeight
(t *testing.T)
graph_test.go:136
Function
TestGenerateDOT
(t *testing.T)
draw/draw_test.go:11
Function
TestGraphAttribute
(t *testing.T)
draw/draw_test.go:367
Function
TestIntHash
(t *testing.T)
graph_test.go:116
Function
TestNew
(t *testing.T)
graph_test.go:8
Function
TestNewLike
(t *testing.T)
graph_test.go:36
Function
TestPreventCycles
(t *testing.T)
traits_test.go:116
Function
TestPriorityQueue_Len
(t *testing.T)
collection_test.go:189
Function
TestPriorityQueue_Pop
(t *testing.T)
collection_test.go:56
Function
TestPriorityQueue_Push
(t *testing.T)
collection_test.go:8
Function
TestPriorityQueue_UpdatePriority
(t *testing.T)
collection_test.go:101
Function
TestRemoveEdge
(t *testing.T)
store_test.go:8
Function
TestRenderDOT
(t *testing.T)
draw/draw_test.go:220
Function
TestRooted
(t *testing.T)
traits_test.go:71
Function
TestStringHash
(t *testing.T)
graph_test.go:96
Function
TestTree
(t *testing.T)
traits_test.go:93
Function
TestUndirectedBFS
(t *testing.T)
traversal_test.go:338
Function
TestUndirectedCreatesCycle
(t *testing.T)
paths_test.go:86
Function
TestUndirectedDFS
(t *testing.T)
traversal_test.go:100
Function
TestUndirectedMaximumSpanningTree
(t *testing.T)
trees_test.go:134
Function
TestUndirectedMinimumSpanningTree
(t *testing.T)
trees_test.go:29
Function
TestUndirectedShortestPath
(t *testing.T)
paths_test.go:302
Function
TestUndirectedStronglyConnectedComponents
(t *testing.T)
paths_test.go:476
Function
TestUndirectedTopologicalSort
(t *testing.T)
dag_test.go:74
Function
TestUndirectedTransitiveReduction
(t *testing.T)
dag_test.go:286
Function
TestUndirected_AddEdge
(t *testing.T)
undirected_test.go:255
Function
TestUndirected_AddEdgesFrom
(t *testing.T)
undirected_test.go:402
← previous
next →
101–200 of 245, ranked by callers