# Package to do graph combinatorics

**URL:** <https://discourse.julialang.org/t/package-to-do-graph-combinatorics/128569>\
**Category:** General Usage\
**Tags:** graphs\
**Created:** [April 30, 2025, 12:27pm UTC](https://discourse.julialang.org/t/package-to-do-graph-combinatorics/128569 "2025-04-30T12:27:10Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![drandran12](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/drandran12/32/220647_2.png) [@drandran12](https://discourse.julialang.org/u/drandran12)\
**Post date:** [April 30, 2025, 12:27pm UTC](https://discourse.julialang.org/t/package-to-do-graph-combinatorics/128569/1 "2025-04-30T12:27:10Z")

</div>

Hey everyone,

I am looking for a package that can do graph combinatorics. For example, suppose I have m distinguishable lines and n distinguishable edges, compute all the possible ways to make the graph.

Anyone who knows of an implementation?