Repository Issues

HHHMHA/approx-max-singly-conn-graph

A simple approximation algorithm to compute a max singly connected graph from an input DAG

View on GitHub
Stars
 (1 star)
Forks
 (0 forks)
Indexed issues
 (0 indexed issues)
open beginner issues
 (0 open beginner issues)
Latest indexed
Jun 13, 2026
Last GitHub push
Sep 27, 2022
License
MIT License
Contributing guide
No contributing guide
Code of conduct
No code of conduct
Dominant language
Java
PR merge metrics
 (No merged PRs in 30d)
Beginner labels
No beginner labels indexed

Issues

0 open indexed issues

RSSAtom

No open indexed issues found for this repository.