Joseph Bradley
Joseph Bradley
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...
In reference to version 224734d7be7ff0c4a8adb3a206356ea122112f33 There is a type: "hnow" should be "how" in the second paragraph.
This is an implementation of a planarity test and an algorithm to construct a planar maximally filtered graph, as mentioned in #153. It is functioning and there are some basic...
I was looking at the following case and got unexpected behaviour: ``` julia> using IntervalRootFinding julia> f(θ) = 2*cos(θ)^2 - 5*cos(θ)^2 + 3 f (generic function with 1 method) julia>...