| 修订版 | e5d6bc430e3dbfa2cc4b49ed027f57b889801493 (tree) |
|---|---|
| 时间 | 2017-10-27 22:19:17 |
| 作者 | Lorenzo Isella <lorenzo.isella@gmai...> |
| Commiter | Lorenzo Isella |
I fixed the names of the output files.
Python-codes/iterate_compose_clusters.py (diff)| @@ -758,7 +758,7 @@ | ||
| 758 | 758 | for j in xrange(len(cluster_list)): |
| 759 | 759 | prefix="aggregate_number_%01d"%(j+1) |
| 760 | 760 | |
| 761 | - prefix2="_generation_%01d"%(gen_count) | |
| 761 | + prefix2="_generation_%01d"%(gen_count+n_gen) | |
| 762 | 762 | |
| 763 | 763 | filename="_.dat" |
| 764 | 764 | filename=prefix+prefix2+filename |
| @@ -781,8 +781,8 @@ | ||
| 781 | 781 | |
| 782 | 782 | |
| 783 | 783 | kf=1.3 |
| 784 | -df= 1.8 # 1.8 | |
| 785 | -epsi=0.001 | |
| 784 | +df= 1.6 # 1.8 | |
| 785 | +epsi= 0.001 | |
| 786 | 786 | n_steps=8000 #with the first algorithm, it is the number of failed attempts |
| 787 | 787 | #to stitch together the two clusters after which |
| 788 | 788 | #I rotate the cluster whose CM I keep fixed in the origin. |
Fork