The picture below shows a graph connecting the cities А, Б, В, Г, Д, Е, Ж, И, К.
On each path you can only move only in direction of the arrow. How many different ways are there from city A to city K?
I understood that this exercise is from graph theory. Please tell me how I can solve exercises like this.
P.S. Sorry for my poor English. It isn't my native language. I would be very grateful if you would mention errors in my English.