Ingest algorithm results into a UGM.
Each entry in the results map is merged as additional properties
on the corresponding node.
Entries naming a node the UGM does not hold are skipped rather than
created: the results are an overlay on a known graph, and inventing
a property-only node would put an element on the canvas that no
source vouched for. The count of those skips is the return value.
Ingest algorithm results into a UGM. Each entry in the results map is merged as additional properties on the corresponding node.
Entries naming a node the UGM does not hold are skipped rather than created: the results are an overlay on a known graph, and inventing a property-only node would put an element on the canvas that no source vouched for. The count of those skips is the return value.