MCPcopy
hub / github.com/TheAlgorithms/Go / Tree

Struct Tree

graph/lowestcommonancestor.go:27–35  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

25}
26
27type Tree struct {
28 numbersVertex int
29 root int
30 MAXLOG int
31 depth []int
32 dad []int
33 jump [][]int
34 edges [][]int
35}
36
37func (tree *Tree) addEdge(u, v int) {
38 tree.edges[u] = append(tree.edges[u], v)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected