How to hard code a graph?

[DeathLeap]

I am trying to implement Dijsktra algorithm and I must use this graph to find the shortest path from node 20 to 21.

https://i.gyazo.com/6f98ea61568771f0e80d433990928f7e.png

I want to know how can I hard code this?

How can I start solving this problem. I need your advice.

Thank you guys!

[ne555]

> I want to know how can I hard code this?
Don't.
Just read from a file.

[DeathLeap]

What I don't understand is how can I specify that a node has three edges if I am going to read from a file?

How can I do that?

[cire]

Use a container?