When we know we need to generate all the possible examples rather than picking up each example randomly, we can iterate over all possible combinations sequentially.
Another related optimization is that now we calculate max possible combinations (cardinality) of each entity in the very beginning, before generating examples.
Minor change: displaying circular entities references path and nested slots path.
When we know we need to generate all the possible examples rather than picking up each example randomly, we can iterate over all possible combinations sequentially.
Another related optimization is that now we calculate max possible combinations (cardinality) of each entity in the very beginning, before generating examples.
Minor change: displaying circular entities references path and nested slots path.