package main

import (
  "fmt"
  "strconv"
)

//edge 要求的順序
var edge map[string]string = map[string]string{
  "2": "5",
  "3": "2",
  "4": "1",
  "1": "3",
}

func main() {
  //結(jié)果數(shù)組
  var q []string = make([]string, 0)
  //已訪(fǎng)問(wèn)數(shù)組
  var visited []string = make([]string, 0)
  for i := 0; i < 5; i++ {
    tupusort(&q, &visited, strconv.Itoa(i))
  }
  // fmt.Printf("visited: %v \n", visited)
  reverse(q)
  fmt.Printf("topusort: %v \n", q)
}

//拓?fù)渑判?DFS
func tupusort(q *[]string, visited *[]string, element string) {
  if !isVisited(visited, element) {
    *visited = append(*visited, element)
    if edge[element] != "" {
      tupusort(q, visited, edge[element])
    }
    *q = append(*q, element)
  }
}

//檢查是否存在已訪(fǎng)問(wèn)的數(shù)組中
func isVisited(visited *[]string, element string) bool {
  var isVisited bool = false
  for _, item := range *visited {
    if item == element {
      isVisited = true
      break
    }
  }
  return isVisited
}

//反轉(zhuǎn)數(shù)組順序
func reverse(arr []string) {
  for i, j := 0, len(arr)-1; i < j; i, j = i+1, j-1 {
    arr[i], arr[j] = arr[j], arr[i]
  }
}