A generic DFS in JavaScript

Question

I implemented a general function for a depth-first-search (DFS) using JavaScript with default arguments and functions that need to be provided in order for it to work.

This function is using async & await, but both can be removed to make it synchronous.

• Is the naming sensible?
• Are there missing pieces that would be useful for a general DFS?
• Any other improvements/suggestions/problems with this code?

async function dfs(
  v         = null,         // vertex `v` for the DFS starting point
  visited   = (v) => false, // function: return true/false if `v` was visited
  visit     = (v) => {},    // function: mark v as visited
  edges     = (v) => [],    // function: return list of vertices reachable from `v`
  previsit  = (v) => {},    // callback called before visiting edges
  postvisit = (v) => {},    // callback called after visiting edges
) {
  await previsit(v)
  await visit(v)
  Promise.all(
    edges(v).map(async (w) => {
      if (!visited(w))
        return await dfs(w, visited, visit, edges, previsit, postvisit)
    })
  )
  await postvisit(v)
}

async function testDfs() {
  const graph = [ // basic adjacency list graph
    { 'id': 'r', 'edges': ['a','b','c'] },
    { 'id': 'a', 'edges': ['b'] },
    { 'id': 'c', 'edges': ['r', 'a'] },
    { 'id': 'b', 'edges': ['d'] },
    { 'id': 'd', 'edges': [] },
  ]
  const visited = [] // list of visited vertex ids
  await dfs(
    graph[0],
    v => visited.includes(v.id),
    v => visited.push(v.id),
    v => graph.filter(w => v['edges'].includes(w.id)),
    v => console.log(' pre', v.id),
    v => console.log('post', v.id)
  )
}

testDfs()