GitHub / ShreckYe / jgrapht-memory-efficient-bipartite-graph
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShreckYe%2Fjgrapht-memory-efficient-bipartite-graph
PURL: pkg:github/ShreckYe/jgrapht-memory-efficient-bipartite-graph
Stars: 1
Forks: 0
Open issues: 0
License: apache-2.0
Language: Kotlin
Size: 64.5 KB
Dependencies parsed at: Pending
Created at: about 6 years ago
Updated at: about 3 years ago
Pushed at: almost 6 years ago
Last synced at: 18 days ago
Topics: bipartite-graphs, hopcroft-karp, jgrapht, kotlin, kuhn-munkres, large-dataset, memory-efficient