[Question]: Usage of Graph Algorithms and Any Slowdowns?

[nv-rliu]

Hi there,

I'm interested in understanding if quimb depends on any graph algorithms from its usage of NetworkX? If so,

• What algorithms are used for what purpose?
• What graph sizes are they being used with?
• Have users experienced any slowdowns or issues with algorithms provided by NetworkX? (Speed, algorithm availability, etc)

Furthermore, would users be interested in accelerated nx algorithms via a GPU backend? This would involve zero code change.

Any insight into this topic would be greatly appreciated! Thank you.

[jcmgray]

Hi @nv-rliu. To answer point-by-point:

• I think the only usage really is some layout algorithms for drawing tensor networks.
• The graphs are generally 10-100s though can be up to 1,000s of nodes.
• Yes the layout algorithms can be pretty slow - though quimb can use the much faster pygraph library optionally

I think fast layout for networks with 1000s+ would be a nice but perhaps fairly niche use case.