tree f4f0f93c59c17de1928fb612f1e169a9cf106184
parent 13180b8e3b919a72796251fbca67a5b50405092d
author Maximilian Michels <mxm@apache.org> 1544536374 +0100
committer Maximilian Michels <mxm@apache.org> 1544793907 +0100

[FLINK-10566] Fix exponential planning time of large programs

The traversal of the DAG is not efficient enough at some places which can lead
to very long plan creation times.

This introduces caching for the traversal to avoid traversing nodes multiple
times. Caching is performed at two places:

- when registering Kryo types
- when determining the maximum parallelism