...
For the step 3.c, the graph needs to have an access to handlers of configuration items. For the graph this can be a structure that implements an interface with Create/Modify/Delete. For every distinct configuration item type (like "Linux route", "container", "Linux bridge", "dnsmasq"), there will be a separate handler registered with the graph. For the graph, these handlers (in the preliminary implementation called "Configurators") are essentially backends or drivers, that the graph calls as needed to synchronize the current state with the latest desired state.
...