#

jgrapht

Here are 2 public repositories matching this topic...

ShreckYe / jgrapht-memory-efficient-bipartite-graph

A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java

kotlin jgrapht memory-efficient large-dataset hopcroft-karp bipartite-graphs kuhn-munkres

Updated Oct 21, 2019
Kotlin

Morinator / FixCon

A Generic Solver for Fixed-Cardinality Subgraph Problems

java graph-algorithms subgraph-count np-complete search-algorithm jgrapht search-trees

Updated Dec 27, 2024
Kotlin

Improve this page

Add a description, image, and links to the jgrapht topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the jgrapht topic, visit your repo's landing page and select "manage topics."