Compute the Nash equilibrium and Price of Anarchy of a routing game

I'm interested in a routing game that models a mobility system and want the Python code to compute the Nash equilibrium and Price of Anarchy of that routing game. All math equations will be provided and the routing network (max 10 players).

The code will have to allow figure plots to compare different values of the equilibria and the Price of Anarchy.