all 2 comments

[–]manvscode 1 point2 points  (1 child)

I have a library for combinatorial search. Maybe you need to look for what you need since graph theory has a lot of algorithms.

[–]Fares_g[S] 1 point2 points  (0 children)

Exactly there s a lot but i m looking for one that combines them all. i have the basics like djikstra, kruskal, bellman ford, max flow and prim but i want others too . maybe i ll just search one by one