Maze / Graph

Forum
General C++ Programming
Maze / Graph

closed account (o2ASLyTq)

Hello!

Well I need help with the following http://pastebin.com/VeNXqPzY

Regards!

dawoodr wrote:
Hello! Well, I need help with the following. Given a (n x m) matrix starting at top left corner how do you find all possible paths given x steps. Example 3x3 matrix and you have 5 steps. 7 2 9 2 7 5 6 1 9 So now starting at 7 you need to find all possible paths/all possible sums using only 5 steps. You can move up, down, left right. Not diagonally or jump between numbers. You can't visit the numbers you already visited twice. I am working in C++. Regards!

dawoodr wrote:

Hello!

Well, I need help with the following. Given a (n x m) matrix starting at top left corner how do you find all possible paths given x steps.

Example 3x3 matrix and you have 5 steps.

7 2 9
2 7 5
6 1 9

So now starting at 7 you need to find all possible paths/all possible sums using only 5 steps. You can move up, down, left right. Not diagonally or jump between numbers. You can't visit the numbers you already visited twice.

I am working in C++.

Regards!

What is your end node? Explain the question and give an example of what you mean

Topic archived. No new replies allowed.