NOTE: this data structure could be memory intensive if the max node ID is much larger than the number of elements in the graph, consider using alternative storage.
Iteratively analyze links in a bipartite graph.
Represents a node on the LHS of a bipartite graph, with a negative node id, all of its in and out edges point to nodes in the RHS, and thus all edge ids have positive values
Represents a node on the RHS of a bipartite graph, with a positive node id, all of its in and out edges point to nodes in the LHS, and thus all edge ids have values of the real id * -1
The node information supplied to the analyzer.