(n *Node)
| 9 | ) |
| 10 | |
| 11 | func findRoot(n *Node) *Node { |
| 12 | if n == nil { |
| 13 | return nil |
| 14 | } |
| 15 | for ; n.Parent != nil; n = n.Parent { |
| 16 | } |
| 17 | return n |
| 18 | } |
| 19 | |
| 20 | func findNode(root *Node, name string) *Node { |
| 21 | node := root.FirstChild |
no outgoing calls
no test coverage detected
searching dependent graphs…