Enables tuning of the internal representation of adjacency lists.
Enables tuning of the internal representation of adjacency lists. Basically, an Array
representation is preferable over a hash table up to a node degree of about 200.
Returns an empty set with built-in hints constructed from size
.
Returns an empty set with default hints that can grow as expected.
Returns an empty set with default hints that can grow as expected.
Returns an empty set with custom hints that can grow as expected.