Is this code for getting the dependency tree of a file correct?
Not a lot of code to review,


To reduce confusion, I would use _.uniq() rather than point straight to uniq()
lowerCamelCase is preferred, child_node -> childNode
dep_tree is unfortunate, I like recursiveDependencies better
I would have set prev_deps = prev_deps || []; prior to return, it would make your recursive call less golfic:

return dep_tree(graph,child_node, prev_deps.concat(node) )