error while coding all-pairs shortest path

Question

0.00/5 (No votes)

See more:

The compiler says errors exist but doesn't give a clue. Where is the errors I can not find?
Thanks for help.

using namespace std;

const int NOT_A_VERTEX = -1;
void allPairs(vector<vector<int> >& a,
              vector<vector<int> >& d,
              vector<vector<int> >& path);

int main() {
    int numberOfVertex;
    int numberOfRoads;
    int minDist;

    cin >> numberOfVertex;
    cin >> numberOfRoads;
    cin >> minDist;

    vector <vector <int> > a(numberOfVertex, vector<int>(numberOfVertex));
    vector <vector <int> > d(numberOfVertex, vector<int>(numberOfVertex));
    vector <vector <int> > path(numberOfVertex, vector<int>(numberOfVertex));
    for(int c = 0 ; c < numberOfRoads; c++){
        int i, j;
        cin >>i; cin >>j;
        a[i][j] = 1;
    }
    allPairs(a,d,path);
    return 0;
}

void allPairs(vector<vector<int> >& a,
              vector<vector<int> >& d,
              vector<vector<int> >& path){
    int n = a.size();
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n ; j++){
            d[i][j] = a[i][j];
            path[i][j] = NOT_A_VERTEX;
        }
    }
    for(int k = 0; k < n ; k++){
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                if(d[i][k] + d[k][j] < d[i][j]){
                    d[i][j] = d[i][k] + d[k][j];
                    path[i][j] = k;
                }
            }
        }
    }

}

Posted 17-Dec-10 8:54am

volvox21

Add a Solution

Comments

Henry Minute 17-Dec-10 17:09pm

Give us a clue! Does the compiler say what the errors are, even if it won't tell you where they are?

volvox21 18-Dec-10 3:53am

I tried today again and it works fine. I don't know why it gave the error yesterday. In addition, I see that although this code is in my book, some things are missing. It doesn't give error now but also doesn't give the correct solution. How can I fix it? Is there any suggestion?

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Alain Rist · Answer 1 · 2010-12-17T11:30:00

Solution 1

Hi,
Your code compiles without error or warning with VC2010 express.
Your error could come from bad project settings.
cheers,
AR

Posted 17-Dec-10 11:30am

Alain Rist

volvox21 · Answer 2 · 2010-12-18T08:09:00

I fixed it.I think this runs well. The last step is how the path is written?

for(int i = 0; i < n; i++){
    for(int j = 0; j < n ; j++){
        if(a[i][j] == 1)
            d[i][j] = a[i][j];
        else
            d[i][j] = INFINITY;
        if(i == j)
            d[i][j] = 0;
        path[i][j] = NOT_A_VERTEX;
    }
}