拓扑排序.go

package main

import (
	"fmt"
	"sort"
)

//gopl 5.6
//给定一些计算机课程，每个
//课程都有前置课程，只有完成了前置课程才可以开始当前课程的学习；我们的目标是选择出
//一组课程，这组课程必须确保按顺序学习时，能全部被完成。
//拓扑排序 深度优先遍历
func main() {
	var prereqs = map[string][]string{
		"algorithms": {"data structures"},
		"calculus":   {"linear algebra"},
		"compilers": {
			"data structures",
			"formal languages",
			"computer organization",
		},
		"data structures":       {"discrete math"},
		"databases":             {"data structures"},
		"discrete math":         {"intro to programming"},
		"formal languages":      {"discrete math"},
		"networks":              {"operating systems"},
		"operating systems":     {"data structures", "computer organization"},
		"programming languages": {"data structures", "computer organization"},
	}

	var order []string
	seen := make(map[string]bool)
	var visitAll func(items []string)
	visitAll = func(items []string) {
		for _, item := range items {
			if !seen[item] {
				seen[item] = true
				visitAll(prereqs[item])
				order = append(order, item)
			}
		}
	}
	var keys []string
	for key := range prereqs {
		keys = append(keys, key)
	}
	sort.Strings(keys)
	visitAll(keys)

	for i, course := range order {
		fmt.Printf("%d:\t%s\n", i+1, course)
	}
}

//1:	intro to programming
//2:	discrete math
//3:	data structures
//4:	algorithms
//5:	linear algebra
//6:	calculus
//7:	formal languages
//8:	computer organization
//9:	compilers
//10:	databases
//11:	operating systems
//12:	networks
//13:	programming languages