You can use this class to check if the graph is cyclic, or to
find index of corresponding join node for the given split node index.
When constructing class, you have to pass it the incidence matrix, which
has to be the two-dimensional array of booleans , where the rows and
column indexes represents the graph node indexes, and values represents
if there is a connection between these nodes.