Add blog post about shortest-path modeling with NetworkX

[amcandio]

This is a follow-up from networkx/networkx#703. I realized these known modeling “tricks” for shortest path problems aren’t well-documented anywhere, so I thought they’d make a great blog post!

This post explains how you can use NetworkX to tackle tricky shortest path problems by tweaking the graph itself, so you can keep using standard algorithms already available in the library.

• The main subject relates to at least one project affiliated to the Scientific Python Ecosystem.
• I have the right to publish the content under BSD 3-Clause License for the code and Creative Common CC-BY-4.0 License for the text.
• Images have been compressed using a tool like pngquant.

[KirstieJane]

Hi @amcandio! This looks so interesting!

I haven't reviewed because I'm on my phone but I was going to read on the preview and it doesn't show up...

Is there a table of contents somewhere that makes the blog show up in the preview?

(I don't know the answer, but sharing in case you can find it easily!)

[amcandio]

I don't know why it doesn't show up. From comparing with other PRs I see that summary is missing, so maybe that's why. I'm also from my phone but let's see if I can fix it!

[amcandio]

Just fixed it @KirstieJane, it was not rendering dates in the future!

[KirstieJane]

Haha! That makes sense I guess 😅😅

I'm looking forward to reading! 🕸️

[rossbar]

This is excellent @amcandio , thanks for writing this up! The post is clear and compelling, and I think the moral of the story cannot be emphasized enough!

I wholeheartedly approve getting this in here, and would also advocate for the post to be turned into an nx-guide as well!

[amcandio]

Thank you so much @rossbar!

[amcandio]

Hi! Any chance anyone can review this one? 🙂 Maybe @stefanv ?