josh/ichigo
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Packages Wiki Activity Actions

comments

Browse source
This commit is contained in:
Josh Deprez 2021-09-24 11:29:08 +10:00
parent fb08ad1de7
commit f144267115
1 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
engine/drawdag.go
View file

@ -358,7 +358,7 @@ func (d dag) removeVertex(v Drawer) {
delete(d, v) delete(d, v)
} }
// addEdge adds the edge u-v in O(1). // addEdge adds the edge (u -> v) in O(1).
func (d dag) addEdge(u, v Drawer) { func (d dag) addEdge(u, v Drawer) {
d.addVertex(u) d.addVertex(u)
d.addVertex(v) d.addVertex(v)
@ -366,7 +366,7 @@ func (d dag) addEdge(u, v Drawer) {
d[u].out[v] = struct{}{} d[u].out[v] = struct{}{}
} }
// removeEdge removes the edge u-v in O(1). // removeEdge removes the edge (u -> v) in O(1).
func (d dag) removeEdge(u, v Drawer) { func (d dag) removeEdge(u, v Drawer) {
delete(d[v].in, u) delete(d[v].in, u)
delete(d[u].out, v) delete(d[u].out, v)
@ -376,7 +376,7 @@ func (d dag) removeEdge(u, v Drawer) {
// O(|V|) temporary memory (for acyclic graphs) and a bit longer if it has to // O(|V|) temporary memory (for acyclic graphs) and a bit longer if it has to
// break cycles. // break cycles.
func (d dag) topWalk(visit func(Drawer)) { func (d dag) topWalk(visit func(Drawer)) {
// Count indegrees - indegree(v) = len(d.in[v]) for each vertex v. // Count indegrees - indegree(v) = len(d[v].in) for each vertex v.
// If indegree(v) = 0, enqueue. Total: O(|V|). // If indegree(v) = 0, enqueue. Total: O(|V|).
queue := make([]Drawer, 0, len(d)) queue := make([]Drawer, 0, len(d))
indegree := make(map[Drawer]int) indegree := make(map[Drawer]int)