Follow-up to #2540, implementing the task graph data structure. The graph currently consists of nodes with edges between them and virtual resources which task nodes can access. The virtual resources allow the user to swap out resources between frames without recompiling the graph, such as e.g. when recreating the swapchain and associated attachments or when reallocating a buffer, etc.
Follow-up to #2540, implementing the task graph data structure. The graph currently consists of nodes with edges between them and virtual resources which task nodes can access. The virtual resources allow the user to swap out resources between frames without recompiling the graph, such as e.g. when recreating the swapchain and associated attachments or when reallocating a buffer, etc.
Changelog: