Package roadmap

[gdalle]

Polynomial problems

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

NP-hard problems

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

See also:

• Move code from GraphFlows and GraphsMatching to GraphsOptim Graphs.jl#108