# Retworkx: new, high-performance Python graph library

**URL:** <https://discourse.julialang.org/t/retworkx-new-high-performance-python-graph-library/71109>\
**Category:** Graphs\
**Tags:** graphs\
**Created:** [November 7, 2021, 6:53pm UTC](https://discourse.julialang.org/t/retworkx-new-high-performance-python-graph-library/71109 "2021-11-07T18:53:14Z")\
**Posts on this page:** 1\
**Showing post:** 12

<div class="post-metadata">

**Author:** ![jlapeyre](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/jlapeyre/32/4514_2.png) [@jlapeyre](https://discourse.julialang.org/u/jlapeyre)\
**Post date:** [November 12, 2021, 4:58pm UTC](https://discourse.julialang.org/t/retworkx-new-high-performance-python-graph-library/71109/12 "2021-11-12T16:58:21Z")

</div>

> [@mtreinish](#):
>
> For those benchmarks I wanted to be as fair as I could for all the python libs so I didn’t use a reader written in rust

I guessed you did it this way because it was simple and perhaps a native reader would be overoptimizing compared to constructing the graph. I think writing the reader in rust (with a Python interface) is perhaps fair. It certainly would be if the graph format were a solid standard (it is not). I was spending some time getting the parsing as fast as I could in Julia (I posted [here](https://discourse.julialang.org/t/fastest-way-to-parse-a-string-of-numbers/16720/21) ) But, constructing a graph with weights swamped this time. It would be easy to test your python reader at just parsing (has the advantage of being very readable code) vs. Julia at just parsing.

---

_[View the full topic](https://discourse.julialang.org/t/retworkx-new-high-performance-python-graph-library/71109)._