复杂网络视角的快捷货运服务网络演进分析

package network;
import java.io.File;
import java.io.FileOutputStream;
import java.text.SimpleDateFormat;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Date;
import java.util.HashMap;
import jxl.Workbook;
public class Evolution
{
    //变量定义
    public static double WW=0.3;
    public static int MM=3;
    public static void start(String transMatrixFile,String startMatrixFile,String outFile)
    {
        Date nowdate=new Date();
        SimpleDateFormat dateFormat=new SimpleDateFormat("HH:mm:ss");
String now=dateFormat.format(nowdate);
System.out.println{''开始处理:"+now);
//读取所有待加入网络的节点
String[] stationprepare=Stations.getStations();
//初始化网络，获得初始网络的节点，节点对应的度，以及节点间距
NetInit.init();
ArrayList stationList=NetInit.getStationList();
HashMap stationDegreeMap = NetInit.getDegreeMap();
HashMap stationDisMap=Netlnit. getDisMap();
//准备节点间的运量OD矩阵;
HashMap transODMap=Transportations.readTransdata(transMatrixFile);
//准备网络的初始连接矩阵

HashMap NetODMap=Transportations.readNetdat(startMatrixFile);
//----------------------------------------------------------准备完毕
//----------------------------------------------------------演化开始
for(int st=0;st<stationprepare.length;st++)
{
//第一步放入一个节点;
String NewStation=stationprepare[st];
//计算初始网络所有点同新加入节点间的概率关系;
double p_1_ sum=0;
double p_2_ sum=0;
double[] p_1=new double[stationList.size()];
double[] p_2=new double[stationList.size()];
for{int i=0;i<p_l.length;i++)
{
String thisStation=(String)(stationList.get(i));
//获取当前节点的度值
String degree=(String)(stationDegreeMap.get(thisStation));
p_1[i]=Double.parseDouble(degree);
p_1_sum+=p_1[i];
//从运量OD矩阵的HashMap中获取o运量数据
String o = (String)transODMap.get(thisStation+"_ "+NewStation};
if(o!=null)
{
    p_2[i]+=Double.parseDouble(o);
}
//从运量OD矩阵的HashMap中获取d运量数据
String d=(String)transODMap.get(NewStation+"_ "+thisStation);
if{d!=null)
{
    p 2[i]+=Double.parseDouble(d);