juliagraphs / graphsoptim.jl Goto Github PK

What is the advice for near term users of this and the flows and matching packages?

Especially in the context of developers. I am comfortable with dealing with deprecations and compatbot PRs for my package. My package will not expose the functionality of these graph packages, only use it internally. Should I depend on the currently available packages or should I politely ask you to register a 0.1.0 version of this package?

https://aviatesk.github.io/JET.jl/stable/jetanalysis/#JET.test_package

Polynomial problems

• shortest path
• flow
• assignment / matching
• spanning tree

NP-hard problems

• coloring
• fractional coloring (see #5)
• vertex / edge cover
• maximum clique / independent set
• traveling salesperson
• graph isomorphism

See also:

• JuliaGraphs/Graphs.jl#108

It would be fairly easy to test our algorithms by comparing their output with the networkx equivalent

Would you be open to a pull request implementing an algorithm for chromatic number and another for fractional chromatic number? The former uses PicoSAT and the latter would use some linear programming solver, perhaps GLPK via JuMP. The chromatic number implementation is here, if you want to take a quick peek: https://gist.github.com/dstahlke/8e4fd40fa845e792ff7cd3f6b4ccb124