{
  "translations" :{
    "en": {
      ".avTitle": "Depth First Search Top Sort Proficiency Exercise",
      "av_Authors": "Ivan Wong",
      ".instructLabel": "Instructions:",
      ".instructions": "Reproduce the behavior of the Top Sort algorithm for the graph below. Just click on the <strong>edges</strong> in the order that they will be traversed by the DFS algorithm. Start with Node A. If there is more than one node that could be visited next, choose the one that comes first in alphabetical order.",
      "av_ms_final": "Final Top Sort graph",
      "av_ms_process_edge": "Process edge ({from}, {to}).",
      "av_ms_already_visited": " Node {node} already visited",
      "#help": "Help",
      "#about": "About"
  },
  "params": {
    "JXOP-feedback": "continuous",
    "JXOP-fixmode": "fix"
  }
}