Skip to content

expose more LEMON graph matching methods #12376

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

Merged
merged 9 commits into from
Oct 26, 2025
Merged

expose more LEMON graph matching methods #12376

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
25a34dc
expose more LEMON graph matching methods
Krastanov Oct 23, 2025
5b6ad45
try to resolve an overloaded method
Krastanov Oct 23, 2025
3569201
simplify things
Krastanov Oct 23, 2025
4492a2e
overload resolve first step
Krastanov Oct 23, 2025
50f9ce4
namespace for Edge
Krastanov Oct 23, 2025
4cc4c63
overload resolve
Krastanov Oct 23, 2025
7dc6ddf
typo
Krastanov Oct 23, 2025
a60432c
edge to arc
Krastanov Oct 23, 2025
d3f0305
more casts
Krastanov Oct 23, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion L/LEMON/build_tarballs.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
using BinaryBuilder, Pkg

name = "LEMON"
version = v"1.3.2"
version = v"1.3.3"
upstreamversion = v"1.3.1"
min_jl_version = v"1.9"

Expand Down
23 changes: 18 additions & 5 deletions L/LEMON/bundled/cxxwrap/lemoncxxwrap.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,10 +29,12 @@ JLCXX_MODULE define_julia_module(jlcxx::Module& mod)
mod.add_type<ListGraph::Node>("ListGraphNode");
mod.add_type<ListDigraph::Node>("ListDigraphNode");
mod.add_type<ListGraph::Edge>("ListGraphEdge");
mod.add_type<ListGraph::Arc>("ListGraphArc");
mod.add_type<ListDigraph::Arc>("ListDigraphArc");

mod.method("id", static_cast<int(*)(ListGraph::Node)>(&ListGraph::id));
mod.method("id", static_cast<int(*)(ListGraph::Edge)>(&ListGraph::id));
mod.method("id", static_cast<int(*)(ListGraph::Arc)>(&ListGraph::id));
mod.method("id", static_cast<int(*)(ListDigraph::Node)>(&ListDigraph::id));
mod.method("id", static_cast<int(*)(ListDigraph::Arc)>(&ListDigraph::id));

Expand Down Expand Up @@ -67,11 +69,22 @@ JLCXX_MODULE define_julia_module(jlcxx::Module& mod)
.constructor<const ListGraph&>()
.method("set", &ListGraph::EdgeMap<int>::set);

mod.add_type<MaxWeightedPerfectMatching<ListGraph, ListGraph::EdgeMap<int>>>("MaxWeightedPerfectMatchingListGraphInt")
using MWPM = MaxWeightedPerfectMatching<ListGraph, ListGraph::EdgeMap<int>>;
using MWPMmatchingedge_ptr = bool (MWPM::*)(const ListGraph::Edge&) const; // used to resolve the overloads of `matching`
using MWPMmatchingnode_ptr = ListGraph::Arc (MWPM::*)(const ListGraph::Node&) const; // used to resolve the overloads of `matching`
MWPMmatchingedge_ptr matchingedge = &MWPM::matching;
MWPMmatchingnode_ptr matchingnode = &MWPM::matching;
mod.add_type<MWPM>("MaxWeightedPerfectMatchingListGraphInt")
.constructor<const ListGraph&, const ListGraph::EdgeMap<int>&>()
.method("mate", &MaxWeightedPerfectMatching<ListGraph, ListGraph::EdgeMap<int>>::mate)
.method("run", &MaxWeightedPerfectMatching<ListGraph, ListGraph::EdgeMap<int>>::run)
.method("matchingWeight", &MaxWeightedPerfectMatching<ListGraph, ListGraph::EdgeMap<int>>::matchingWeight);

.method("mate", &MWPM::mate)
.method("run", &MWPM::run)
.method("matchingWeight", &MWPM::matchingWeight)
.method("matching", matchingedge)
.method("matching", matchingnode)
.method("dualValue", &MWPM::dualValue)
.method("nodeValue", &MWPM::nodeValue)
.method("blossomNum", &MWPM::blossomNum)
.method("blossomSize", &MWPM::blossomSize)
.method("blossomValue", &MWPM::blossomValue);
}