flowmain.cpp

牛顿-拉夫逊法潮流计算的算法实现

////////////////////////////////////////////////////////////////////////////////////////
//////////////////   潮流计算主程序                /////////////////////
///////////////////////////////////////////////////////////////////////////////////////
#include <String.h>
#include "GeneralInfo.h"
#include "ReadData.h"
#include "NodeOptimize.h"
#include "YMatrix.h"
#include "Jacobi.h"
#include "PowerFlow.h"
#define RE 10
void main()
{
	CReadData readdata;
	char filename[20];
	cout<<"请输入要计算的原始数据文件名(5节点对应的是5.txt,依次类推)： "<<endl;
	cin>>filename;

	if(!strcmp(filename,"5.txt"))
	{
       strcpy(filename,"输入数据//5.txt");
	}
    else if(!strcmp(filename,"14.txt"))
	{
	    strcpy(filename,"输入数据//14.txt");
	}
	else if(!strcmp(filename,"30.txt"))
	{
		strcpy(filename,"输入数据//30.txt");
	}
	else if(!strcmp(filename,"57.txt"))
	{
		strcpy(filename,"输入数据//57.txt");
	}
	else if(!strcmp(filename,"118.txt"))
	{
		strcpy(filename,"输入数据//118.txt");
	}
	readdata.Read(filename);
	NodeOptimize Nodeoptimize;
	Nodeoptimize.OptimizeType=readdata.BusOptimType;
	if(Nodeoptimize.OptimizeType!=0)
	{
     Nodeoptimize.AdjustNodeNo();
	}
	 extern SystemInfo m_SystemInfo;   ///系统信息

	 int *new_old=new int[m_SystemInfo.SystemTotalBusNum+RE];
     for(int i=1;i<=m_SystemInfo.SystemTotalBusNum;i++)
	 {
         new_old[i]=Nodeoptimize.new_old[i];
	 }
//	YMatrix Ymatrix;
// 	Ymatrix.SpareYMatrix();
//	Jacobi jacobi;	
//	jacobi.GetNewInNum();
// 	jacobi.FormJacobi();
//  jacobi.GetNonZeroNum();

	PowerFlow powerflow;
	powerflow.MaxIteraNum=readdata.MaxIteraNum;   ///最大迭代数目
	powerflow.IteraError=readdata.IteraError; ///最大迭代误差
	powerflow.PFlow();
	powerflow.OutputResult(filename,new_old);

}