蚁群优化算法的C ++代码 [英] C++ code for ant colony optimization algorithm

问题描述

在多个节点之间找到最短路径



我尝试过：

to find shortest path among a number of nodes

What I have tried:

#include <iostream>

using namespace std;
#define INT_MAX  999999

int n=4;
int dp[16][4];
int dist[10][10]={
    {0,20,42,25},
    {20,0,20,34},
    {42,30,0,10},
    {25,34,10,0},
};
int VISITED_ALL=(1<<n)-1;

int tsp(int mask,int pos){
   if(mask==VISITED_ALL){
     return dist[pos][0];
 }
   if(dp[mask][pos]!=-1)
 {
     return dp[mask][pos];
 }
    int ans=INT_MAX;
      for(int city=0;city<n;city++)
      {
        if(mask&(1<<city)==0)
     {
         int newAns=dist[pos][city]+tsp(mask|(1<<city),city);
         ans=min(ans,newAns);
     }
 }
 return dp[mask][pos]=ans;
}
int min (int a, int b)
{
    int p,q;
    
    if(p<q){
     printf("p");
    }
    else{
     printf("q");
    }
}
   
int main()
{
    for(int i=0;i<(1<<n);i++){
        for(int j=0;j<n;j++)
        {
            dp[i][j]=-1;
        }}
        cout<<tsp(1,0)<<endl;
        return 0;
}

这是我试过的代码，但它没有产生正确的输出

this is the code i have tried but it doesn't produce the correct output

推荐答案

引用：

它不会产生正确的输出

告诉我们什么是正在发生的事情：它是无用的错误报告。



编译并不意味着你的代码是正确的！ ：笑：

将开发过程想象成编写电子邮件：成功编译意味着您使用正确的语言编写电子邮件 - 例如英语而不是德语 - 而不是电子邮件包含您的邮件想发送。



所以现在你进入第二阶段的发展（实际上它是第四或第五阶段，但你将在之后的阶段进入）：测试和调试。



首先查看它的作用，以及它与你想要的有何不同。这很重要，因为它可以为您提供有关其原因的信息。例如，如果程序旨在让用户输入一个数字并将其翻倍并打印答案，那么如果输入/输出是这样的：

Tells us nothing about what is going on: it is a useless error report.

Compiling does not mean your code is right! :laugh:
Think of the development process as writing an email: compiling successfully means that you wrote the email in the right language - English, rather than German for example - not that the email contained the message you wanted to send.

So now you enter the second stage of development (in reality it's the fourth or fifth, but you'll come to the earlier stages later): Testing and Debugging.

Start by looking at what it does do, and how that differs from what you wanted. This is important, because it give you information as to why it's doing it. For example, if a program is intended to let the user enter a number and it doubles it and prints the answer, then if the input / output was like this:

Input   Expected output    Actual output
  1            2                 1
  2            4                 4
  3            6                 9
  4            8                16

然后很明显问题出在将它加倍的位 - 它不会将自身加到自身上，或者将它乘以2，它会将它自身相乘并返回输入的平方。

所以，你可以查看代码和很明显，它在某处：

Then it's fairly obvious that the problem is with the bit which doubles it - it's not adding itself to itself, or multiplying it by 2, it's multiplying it by itself and returning the square of the input.
So with that, you can look at the code and it's obvious that it's somewhere here:

int Double(int value)
   {
   return value * value;
   }

一旦你知道可能出现的问题，就开始使用调试器找出原因。在方法的第一行放置一个断点，然后运行你的应用程序。当它到达断点时，调试器将停止，并将控制权移交给您。您现在可以逐行运行代码（称为单步执行）并根据需要查看（甚至更改）变量内容（哎呀，您甚至可以更改代码并在需要时再试一次）。 />
在执行代码之前，请考虑代码中的每一行应该做什么，并将其与使用Step over按钮依次执行每一行时实际执行的操作进行比较。它符合您的期望吗？如果是这样，请转到下一行。

如果没有，为什么不呢？它有什么不同？

希望这可以帮助你找到代码的哪个部分有问题，以及问题是什么。

这是一项技能，它是一个值得开发的，因为它可以帮助你在现实世界和发展中。和所有技能一样，它只能通过使用来改进！

Once you have an idea what might be going wrong, start using the debugger to find out why. Put a breakpoint on the first line of the method, and run your app. When it reaches the breakpoint, the debugger will stop, and hand control over to you. You can now run your code line-by-line (called "single stepping") and look at (or even change) variable contents as necessary (heck, you can even change the code and try again if you need to).
Think about what each line in the code should do before you execute it, and compare that to what it actually did when you use the "Step over" button to execute each line in turn. Did it do what you expect? If so, move on to the next line.
If not, why not? How does it differ?
Hopefully, that should help you locate which part of that code has a problem, and what the problem is.
This is a skill, and it's one which is well worth developing as it helps you in the real world as well as in development. And like all skills, it only improves by use!

您需要使用调试器。我在一个函数中看到了一些严重的错误。

You need to use the debugger. I see some severe bugs in one function.

int min (int a, int b)
{
    //int p,q; not needed
    if(a<b){
     printf("p");
     return a;
    }
    else{
     printf("q");
     return b;
    }
}

您需要调用main函数中的所有代码。所以使用调试器!!!

And you need to call all code in the main function. So use the debugger!!!

这篇关于蚁群优化算法的C ++代码的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！