Provide default implementations for counts and bounds - Githubissues

pnevyk / gryf

Graph data structure library aspiring to be convenient, versatile, correct and performant.

MIT License

69 stars 1 forks source link

Provide default implementations for counts and bounds #7

Closed pnevyk closed 1 month ago

pnevyk commented 2 years ago

Provide default implementations for counts and bounds in respective traits (VerticesBase, EdgesBase, VerticesBaseWeak, EdgesBaseWeak).

vertex_count and edge_count can be implemented by counting items in self.vertex_indices() and self.edge_indices() iterators, respectively.
vertex_bound and edge_bound can be implemented by finding maximum in self.vertex_indices() and self.edge_indices() iterators, respectively.
vertex_count_weak, vertex_bounds_weak, edge_count_weak and edge_bounds_weak can return None

In all cases, keep the current (efficient) implementation.

pnevyk commented 1 month ago

Resolved as part of https://github.com/pnevyk/gryf/pull/78