Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implementation for planar maximally filtered graph #153

Open
josephcbradley opened this issue Jul 11, 2022 · 1 comment
Open

Implementation for planar maximally filtered graph #153

josephcbradley opened this issue Jul 11, 2022 · 1 comment
Labels
enhancement New feature or request

Comments

@josephcbradley
Copy link

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 gdalle added the enhancement New feature or request label Jul 11, 2022
@gdalle
Copy link
Member

gdalle commented Jul 11, 2022

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

josephcbradley added a commit to josephcbradley/Graphs.jl that referenced this issue Dec 18, 2022
@josephcbradley
Implementation for planarity test
c80f2f8 
First step to fixing JuliaGraphs#153
@josephcbradley josephcbradley mentioned this issue Dec 18, 2022
Closed
@josephcbradley josephcbradley mentioned this issue Jan 2, 2023
Open
3 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@gdalle @josephcbradley