RubyTuesdayDONO

// Dependency resolution, adapted from https://gist.github.com/1232505/f16308bc14966c8d003c2686b1c258ec41303c1f
function resolve(graph) {
  var sorted  = [], // sorted list of IDs ( returned value )
      visited = {}; // hash: id of already visited node => true

  // 2. topological sort
  Object.keys(graph).forEach(function visit(name, ancestors) {
    if (!Array.isArray(ancestors)) ancestors = [];
    ancestors.push(name);
    visited[name] = true;