[[concept]]computational graph
The computational graph tracks the communications that each node makes at each layer or iteration of an algorithm/network.
Example
Since 1 and 3 are symmetric, their computational graph is symmetric
is sufficient because the diameter (or the longest shortest path between two nodes) is of length 2.
Mentions
TABLE
FROM [[]]
FLATTEN choice(contains(artist, this.file.link), 1, "") + choice(contains(author, this.file.link), 1, "") + choice(contains(director, this.file.link), 1, "") + choice(contains(source, this.file.link), 1, "") as direct_source
WHERE !direct_source