Implementation for planar maximally filtered graph

[josephcbradley]

Graphs.jl currently lacks an implementation for finding a planar maximally filtered graph (PMFG). PMFG is a very useful tool and should be included in a good graphs package!

NetworkX currently has one here so my suggestion would be to start by translating that into Julia and go from there.

Does anyone have any suggestions/recommendations?

[gdalle]

Hi @josephcbradley and thanks for the suggestion! Would you be willing to submit a PR with a first implementation draft?