Is there a way to find faces of a graph using QuickGraph for C#, similar to the Planar Face Traversal function in the Boost C++ Graph Library? https://www.boost.org/doc/libs/1_51_0/libs/graph/doc/planar_face_traversal.html
Is there a way to find faces of a graph using QuickGraph for C#, similar to the Planar Face Traversal function in the Boost C++ Graph Library?
https://www.boost.org/doc/libs/1_51_0/libs/graph/doc/planar_face_traversal.html