Data for a graph of interconnected nodes can be efficiently calculated with the faceting code. A compact format, such as
nodes (integer ID implicit by position)
foo
bar
zoo
edges
0,1
0,2
2,1
1,2
could be used. In order to generate such result, a standard counter update can be performed and a map from ordinals to logical node IDs can be generated. A second pass will then use the map to resolve the edge IDs.
Data for a graph of interconnected nodes can be efficiently calculated with the faceting code. A compact format, such as
could be used. In order to generate such result, a standard counter update can be performed and a map from ordinals to logical node IDs can be generated. A second pass will then use the map to resolve the edge IDs.