a VerticeClassification when done
(countingVCBuilder: StringAdd).self
(countingVCBuilder: StringFormat).self
(countingVCBuilder: ArrowAssoc[CountingVCBuilder[Rdf]]).x
(Since version 2.10.0) Use leftOfArrow
instead
(countingVCBuilder: Ensuring[CountingVCBuilder[Rdf]]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
This is a much too simple Vertice classifier. It is useful to test the MappingGenerator though. It classifies each vertice by the number of certain types of relations it has. WARNING: Do not use in production! Checking isomorphisms with this class on a list with a little duplication can make your machine stall. eg: comparing two graphs each containing the same two lists of length 6 and 5 can lead to a search tree of 65 million. This is better that the full ~ 10 billion search space, but nowhere near small enough to be useful. In comparison the SimpleHashVerticeType brings that down to 64.
This is a case class as the case class, as that gives us the equals and hash methods. One could use an immutable Map, but that may be more expensive.