Last active
March 11, 2016 11:54
-
-
Save alyssais/19f369ea6a5adf9e93eb to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import Foundation | |
typealias Forest = Tree[] | |
protocol Tree { | |
func parent() -> Tree? | |
func nodes() -> Forest | |
} | |
func nodes(tree: Tree) -> Forest { | |
return tree.nodes() | |
} | |
func root(tree: Tree) -> Tree { | |
let parent = parent(tree) | |
if parent { return root(parent!) } | |
return tree | |
} | |
func parent(tree: Tree) -> Tree? { | |
return tree.parent() | |
} | |
func siblings<T where T: Tree, T: AnyObject>(tree: T) -> Forest { | |
if let parent = parent(tree) { | |
let siblings = (nodes(parent) as NSArray).mutableCopy() as NSMutableArray | |
siblings.removeObject(tree) | |
return siblings.copy() as Array | |
} | |
return [] | |
} | |
func leaves(tree: Tree) -> Forest { | |
return nodes(tree).filter { nodes($0).isEmpty } | |
} | |
func internalNodes(tree: Tree) -> Forest { | |
return nodes(tree).filter { !nodes($0).isEmpty } | |
} | |
func degree(tree: Tree) -> Int { | |
return nodes(tree).count | |
} | |
func level(tree: Tree) -> Int { | |
var level = 0 | |
var node: Tree? = tree | |
while node { | |
level++ | |
node = parent(tree) | |
} | |
return level | |
} | |
func height(tree: Tree) -> Int { | |
if nodes(tree).isEmpty { return 0 } | |
return 1 + maxElement(nodes(tree).map(height)) | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment