What is the `maxDepth`

parameter of `algo.kShortestPaths`

?

Can this parameter be used to make the algorithm more efficient by not searching beyond some depth? Depth of what?

For example, after determining the shortest path, can this parameter be used to constrain the maximum number of nodes in a path?