At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

|dw:1440284134239:dw|

You're welcom

I'm on iPad , cannot draw out the paths, b to me , there are 2 shortest ways , and their weight is 6

I will go look at my graph theory book and I am sure I will find something.

are u sure its 6

Go, diagonal fromA, 3 times, then go straight to B 3 more

there are algorithms for this, that would be a pain to teach on here.
google Dijkstra's algorithm

diagonal?

along the lines, if the question was for me.

Djikistra algorithm finds shortest distance,
where as i need the number of shortest paths

Go to the right of A 1, then, diagonal, then right,then,diagonal,repeat 1 more time to get B

Use adjacent matrix to find them out. It works also

Why not diagonal? Since it is = right+ vertical up.?

answer is 210 for 1st one

the path has to along the lines can't jump diagonally

Ohoh, so I'm wrong, hehe.

|dw:1440285501178:dw|
an example

Yes that is right, there is some algorithm that will tell you.

thanks @mathmate ur anwers was correct

You're welcome! :)