For many basic network analyses the algorithms that come with the NetworkX package will work just fine and you won’t need one of the spezialised topology functions.
Finding the shortest path between two buses is a good example for that.

calc_distance_to_bus allows you to calculate the distance ( = shortest network route) from one bus all other ones.
This is possible since line lengths are being transferred into the MultiGraph as an edge attribute.
(Note: bus-bus-switches and trafos are interpreted as edges with length = 0)

Another example of what you can do with the right combination of input arguments when creating the MultiGraph is finding
rings and ring sections in your network. To achieve that for our example network, the trafo buses needs to
be set as a nogobuses. With respect_switches = True you get the ring sections, with respect_switches = False the whole ring.