Planning dynamic indexing implementation

Make run-time topological sorting work (separately from using it later for dynamic indices)

• Move C++ version of topologicalSort into working branch.

• Make a version of C++ calculate(nodeFunctionVector) or calculate(nodeFunctionVector$getNodes()) or calculate(getNodes(nodeFunctionVector)) that gets dependencies first.

• Draft an extension of nodeFunctionVector concept to somehow indicate that dependencies need to be calculated at run-time.