JuliaGraphs / JuliaGraphs/Graphs.jl
Implementation for planar maximally filtered graph
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
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?
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the linked NetworkX planarity implementation and compare its purpose with the requested planar maximally filtered graph. Clarify whether the issue targets PMFG construction or planarity checking, then define the public behavior and validation required before implementation is complete.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100