Constructing the canonical bpt does not require iterators on out/in edges or adjacent vertices and a simple list of edges is sufficient (which is lighter than an instance of UndirectedGraph).
This could be added without breaking backward compatibility and without any extra cost if undirected graphs add views on their edge sources/targets.
Constructing the canonical bpt does not require iterators on out/in edges or adjacent vertices and a simple list of edges is sufficient (which is lighter than an instance of UndirectedGraph).
This could be added without breaking backward compatibility and without any extra cost if undirected graphs add views on their edge sources/targets.