# Existing Graph Algorithms **URL:** \ **Category:** Dev\ **Created:** [October 29, 2023, 5:43pm UTC](https://forum.graphviz.org/t/existing-graph-algorithms/1852 "2023-10-29T17:43:45Z")\ **Posts on this page:** 3\ **Page:** 1
**Author:** ![Vithanco](https://sea2.discourse-cdn.com/graphviz/user_avatar/forum.graphviz.org/vithanco/32/292_2.png) [@Vithanco](https://forum.graphviz.org/u/Vithanco)\ **Post date:** [October 29, 2023, 5:43pm UTC](https://forum.graphviz.org/t/existing-graph-algorithms/1852/1 "2023-10-29T17:43:46Z")
I wonder what kind of graph algorithms exist within the Graphviz code? I already use Graphviz to layout my graphs. But could I do other things as well? Stuff like: • Finding loops? • Dijkstra • Components? • etc What else is under the hood of this great library? ---
**Author:** ![steveroush](https://avatars.discourse-cdn.com/v4/letter/s/a9adbd/32.png) [@steveroush](https://forum.graphviz.org/u/steveroush)\ **Post date:** [October 29, 2023, 8:35pm UTC](https://forum.graphviz.org/t/existing-graph-algorithms/1852/2 "2023-10-29T20:35:31Z")
Here is a start - go here ([acyclic | Graphviz](https://graphviz.org/docs/cli/acyclic/)) & look at the commands listed in the left column (e.g. gc, dijkstra, gvpr, …) There are also some **gvpr** programs here ([acyclic | Graphviz](https://graphviz.org/docs/cli/acyclic/)) that do not seem to be in some (all?) of the deliverables ---
**Author:** ![Vithanco](https://sea2.discourse-cdn.com/graphviz/user_avatar/forum.graphviz.org/vithanco/32/292_2.png) [@Vithanco](https://forum.graphviz.org/u/Vithanco)\ **Post date:** [November 4, 2023, 11:56am UTC](https://forum.graphviz.org/t/existing-graph-algorithms/1852/3 "2023-11-04T11:56:41Z")
Thanks, Steve! I should have said that I use Graphviz as a library. So I could make use of internal algorithms. I am sure that Graphviz relies on quite a few algorithms to do the layout. But which ones? 🙂