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

[nv-rliu]

Hi there,

I'm interested in understanding if pyrender 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.