Default maximal complexity value. Algorithmically, this number is multiplied
with the number of bnodes in a given dataset, thereby yielding the maximum times
the computeNDegreeHash function can be called (this function is invoked
in only a few cases when there two blank nodes get the same hash value in the
first pass of the algorithm but, then, the call may become recursive).
Setting this number to a reasonably low number,
ensures that some "poison graphs" would not result in an unreasonably long canonicalization process.
See the [security consideration section](https://www.w3.org/TR/rdf-canon/ #security-considerations)
in the specification.
Default maximal complexity value. Algorithmically, this number is multiplied with the number of bnodes in a given dataset, thereby yielding the maximum times the
computeNDegreeHashfunction can be called (this function is invoked in only a few cases when there two blank nodes get the same hash value in the first pass of the algorithm but, then, the call may become recursive).Setting this number to a reasonably low number, ensures that some "poison graphs" would not result in an unreasonably long canonicalization process. See the [security consideration section](https://www.w3.org/TR/rdf-canon/ #security-considerations) in the specification.