Viewing of in-progress runs can be slow. This includes infrequently updating very large runs (few thousand tasks), or medium-sized runs that update frequently.
Graph update operations (e.g. calculating descendants/children per node, etc) should be done incrementally as tasks are added. Currently, all graph structure changes cause full re-calcs of most derived graph data.
Viewing of in-progress runs can be slow. This includes infrequently updating very large runs (few thousand tasks), or medium-sized runs that update frequently.
Graph update operations (e.g. calculating descendants/children per node, etc) should be done incrementally as tasks are added. Currently, all graph structure changes cause full re-calcs of most derived graph data.