編集履歴

質問編集履歴

文法の修正とprintfの追加

2019/11/29 02:28

投稿

ro_tose

スコア8

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -44,109 +44,225 @@
+#include "sub.h"
+double pheromone_0;
+ double alpha;
+ double beta;
+ double rho;
+ double q_0;
+ int n;
+ int nant;
+void erace(void){
+ alpha=1.0;
+ beta=1.0;                       //ヒューリスティック情報の優先度
+ rho=0.5;                         //フェロモン蒸発率
+ q_0=0;
+ pheromone_0=1.0;
+printf("pheromone_0;%f\n",pheromone_0);
+ initial_pheromone( pheromone_0);
+printf("%f\n",pheromone[0][0]);
+}
+int main(int argc, char *argv[]){
+ int i;
+ n=51;
+ nant=10;                         //アリの数
+ start_program();
+  erace();
+ for(i=0;i<n;i++){
+   free(pheromone[i]);
+   free(total[i]);
+ }
+ free(total);
+ free(pheromone);
+   return(0);
+}
+```
+```
+sub.c
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <time.h>
+#include <limits.h>
 #include "tesb.h"
+ant_struct *ant;
+ant_struct *bestant;
-double pheromone_0;
+double **pheromone;
- double alpha;
- double beta;
+double **total;
- double rho;
- double q_0;
-void erace(void){
- alpha=1.0;
- beta=1.0;                       //ヒューリスティック情報の優先度
- rho=0.5;                         //フェロモン蒸発率
+void initial_pheromone(double initial_trail) //フェロモンの初期化
+{
- q_0=0;
+    long int i, j;
+    for ( i = 0 ; i < n ; i++ ) {
+    for ( j =0 ; j <=i ; j++ ) {
- pheromone_0=1.0;
+      pheromone[i][j] = initial_trail;
- printf("%f\n",pheromone_0);
- initial_pheromone( pheromone_0);
+        pheromone[j][i]=pheromone[i][j];
+    }
+    }
 }
-int main(int argc, char *argv[]){
+void start_program(void)
+{
- int i;
+  int i,j;
- int n;
+   if((ant=malloc(sizeof(ant_struct)*nant+sizeof(ant_struct *)*nant))==NULL){
- n=51;
- nant=10;                         //アリの数
+   printf("out of memory,exit");
- start_program();
-  erace();
+  exit(1);
- free(bestant->tour);
- free(bestant->visited);
- for(i=0;i<nant;i++){
-   free(ant[i].tour);
-   free(ant[i].visited);
  }
- for(i=0;i<n;i++){
+  for(i=0;i<nant;i++){
+    ant[i].tour=calloc(n+1,sizeof(int));
+    ant[i].visited=calloc(n,sizeof(char));
+  }
+  if((bestant=malloc(sizeof(ant_struct)))==NULL){
-   free(pheromone[i]);
+   printf("out of memory,exit");
-   free(total[i]);
+  exit(1);
  }
+  bestant->tour=calloc(n+1,sizeof(int));
+  bestant->visited=calloc(n,sizeof(char));
- free(total);
+ pheromone=malloc(sizeof(double *)*n);
- free(pheromone);
+  for(i=0;i<n;i++){
+    pheromone[i]=malloc(sizeof(double*)*n);
+  }
+  total=malloc(sizeof(double *)*n);
-   free(ant);
+  for(i=0;i<n;i++){
-   return(0);
+    total[i]=malloc(sizeof(double*)*n);
+  }
 }
@@ -154,130 +270,6 @@
 ```
-sub.c
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-#include <time.h>
-#include <limits.h>
-#include "tesb.h"
-ant_struct *ant;
-ant_struct *bestant;
-double **pheromone;
-double **total;
-void initial_pheromone(double initial_trail) //フェロモンの初期化
-{
-    long int i, j;
-    for ( i = 0 ; i < n ; i++ ) {
-    for ( j =0 ; j <=i ; j++ ) {
-      pheromone[i][j] = initial_trail;
-        pheromone[j][i]=pheromone[i][j];
-    }
-    }
-}
-void start_program(void)
-{
-  int i,j;
-   if((ant=malloc(sizeof(ant_struct)*nant+sizeof(ant_struct *)*nant))==NULL){
-   printf("out of memory,exit");
-  exit(1);
- }
-  for(i=0;i<nant;i++){
-    ant[i].tour=calloc(n+1,sizeof(int));
-    ant[i].visited=calloc(n,sizeof(char));
-  }
-  if((bestant=malloc(sizeof(ant_struct)))==NULL){
-   printf("out of memory,exit");
-  exit(1);
- }
-  bestant->tour=calloc(n+1,sizeof(int));
-  bestant->visited=calloc(n,sizeof(char));
- pheromone=malloc(sizeof(double *)*n);
-  for(i=0;i<n;i++){
-    pheromone[i]=malloc(sizeof(double*)*n);
-  }
-  total=malloc(sizeof(double *)*n);
-  for(i=0;i<n;i++){
-    total[i]=malloc(sizeof(double*)*n);
-  }
-}
-```
-```
 ファイル　sub.h
 typedef struct {

誤字などの修正、intをdoubleに変更

2019/11/29 02:28

投稿

ro_tose

スコア8

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -28,13 +28,11 @@
 ファイル as.c
 #include <stdio.h>
 #include <math.h>
-#include <limits.h>
+#include <limits.h>
 #include <assert.h>
@@ -46,7 +44,7 @@
-#include "sub.h"
+#include "tesb.h"
@@ -74,9 +72,9 @@
  q_0=0;
- printf("%d\n",nntour());
- pheromone_0=1/((rho)*nntour());
+ pheromone_0=1.0;
  printf("%f\n",pheromone_0);
@@ -86,7 +84,7 @@
-iint main(int argc, char *argv[]){
+int main(int argc, char *argv[]){
@@ -106,8 +104,6 @@
- scanf("%\n",&optimal);
  start_program();
@@ -116,9 +112,9 @@
@@ -174,7 +170,7 @@
-#include "sub.h"
+#include "tesb.h"
@@ -198,27 +194,25 @@
     long int i, j;
     for ( i = 0 ; i < n ; i++ ) {
-	for ( j =0 ; j <=i ; j++ ) {
+    for ( j =0 ; j <=i ; j++ ) {
-	  pheromone[i][j] = initial_trail;
+      pheromone[i][j] = initial_trail;
-	    pheromone[j][i]=pheromone[i][j];
+        pheromone[j][i]=pheromone[i][j];
-	    total[i][j] = pow(pheromone[i][j],alpha)*pow(HEURISTIC(i,j),beta);
-	    total[j][i]=total[i][j];
-	}
     }
+    }
 }
@@ -236,7 +230,7 @@
  }
   for(i=0;i<nant;i++){
@@ -258,23 +252,23 @@
   bestant->visited=calloc(n,sizeof(char));
- pheromone=malloc(sizeof(int *)*n);
+ pheromone=malloc(sizeof(double *)*n);
   for(i=0;i<n;i++){
-    pheromone[i]=malloc(sizeof(int*)*n);
+    pheromone[i]=malloc(sizeof(double*)*n);
   }
-  total=malloc(sizeof(int *)*n);
+  total=malloc(sizeof(double *)*n);
   for(i=0;i<n;i++){
-    total[i]=malloc(sizeof(int*)*n);
+    total[i]=malloc(sizeof(double*)*n);
   }
@@ -284,7 +278,7 @@
 ```
-ファイル　tesb.h
+ファイル　sub.h
 typedef struct {
@@ -358,9 +352,7 @@
 extern double **pheromone;
+extern double **total;
@@ -369,3 +361,5 @@
 ### 試したこと
 配列が問題なのかと思って配列を表示してみたりしたのですが配列のメモリもしっかり用意できていました。
+修正してみたのですがまだエラーがでてしまいます。明日またmallocを使わない方法でやってみようと思います