Matching under preferences

Dear Devs,

Is there any implementation of preferential matching algorithms (such as the Gale-Shapley algorithm)? Any tool to develop “preferable” data structures helps (such as an edge data structure, where the edge has a capacity, a flow traversing it, a lower bound for the flow (demand), a cost, etc. so I’m looking for a universal tool).

No, preferential matching is not implemented. The flow-based algorithms that exist can be found here: graph_tool.flow - Maximum flow algorithms — graph-tool 2.45 documentation