Example #1
0
func main() {
	// imagine constructing this tree:
	// ((A:0.1, B:0.2)95:0.3, C:0.25, D:0.15);
	tree := node.New()
	ABclade := tree.AddChild()
	A := ABclade.AddChild()
	B := ABclade.AddChild()
	C := tree.AddChild()
	D := tree.AddChild()
	ABclade.AddBranchLength(0.3)
	ABclade.AddSupportValue(95)
	tree.AddNodeLabel("tree")
	A.AddNodeLabel("A")
	B.AddNodeLabel("B")
	C.AddNodeLabel("C")
	D.AddNodeLabel("D")
	ABclade.AddNodeLabel("ABclade")
	A.AddBranchLength(0.1)
	B.AddBranchLength(0.2)
	C.AddBranchLength(0.25)
	D.AddBranchLength(0.15)

	// tree._preorderTraverse()
	s := node.NewStack()
	s.Push(A)
	n := s.Pop()
	fmt.Println(n)
}
Example #2
0
func main() {
	q := node.NewQueue(3)
	m := node.New()
	m.AddNodeLabel("m")
	n := node.New()
	n.AddNodeLabel("n")
	o := node.New()
	o.AddNodeLabel("o")
	q.Remove()
	q.Add(m)
	q.Add(o)
	q.Add(n)
	q.Add(o)
	One := q.Remove()
	Two := q.Remove()
	Thr := q.Remove()
	fmt.Println(One)
	fmt.Println(Two)
	fmt.Println(Thr)
}