用C#实现关键路径.doc

数据结构实验报告-用C#实现关键路径using System;using System.Collections.Generic;using System.Text;namespace LJH.AOE/项目过程 public class ProjectItem/起始项目 private int begin;/终止项目 private int end;/所用的时间 private int buttom;/构造函数 public ProjectItem(int b,int e,int but) begin= b; end= e; buttom= but; /属性 public int Begingetreturn begin; set begin= value; public int Endgetreturn end; set end= value; public int Buttomgetreturn buttom; set buttom= value; /结点类 public class EdgeNodeprivate int adjvex;/* 邻接点域*/private int period;/* 时间域*/private EdgeNode next;public int Adjvexgetreturn adjvex; set adjvex= value; public int Periodgetreturn period; set period= value; public EdgeNode Nextgetreturn next; set next= value; /定义链接图的类型 public class Vexnodeprivate string vertex;private int id;private EdgeNode link;/属性 public string Vertexgetreturn vertex; set vertex= value; public int IDgetreturn id; set id= value; public EdgeNode Linkgetreturn link; set link= value; /AOE网 public class AlGraphprivate Vexnode graphic;private int projectnum;private int activenum;private int totaltime;int vl ;int ve ;int l ;int e ;/属性 public Vexnode Graphicgetreturn graphic; set graphic= value; public int TotalTimegetreturn totaltime; public int Vlgetreturn vl; public int Vegetreturn ve; public int Lgetreturn l; public int Egetreturn e; /构造函数 public AlGraph(int pnum,int anum) totaltime= 0; projectnum= pnum; activenum= anum; graphic= new Vexnodepnum;for (int i= 0; i projectnum; i+) graphici= new Vexnode(); /建立AOE网 private void CreateGraph(ProjectItem item)for (int i= 0; i projectnum; i+) graphici.Vertex= i.ToString(); graphici.ID= 0; graphici.Link= null; for (int k= 0; k activenum; k+) EdgeNode p= new EdgeNode(); p.Adjvex= itemk.End- 1; p.Period= itemk.Buttom; graphicitemk.End- 1.ID+; p.Next= graphicitemk.Begin- 1.Link; graphicitemk.Begin- 1.Link= p; /搜索关键路径 public bool SearchMap(ProjectItem item)int rear= -1, m= 0, front= -1, j, k; EdgeNode p; CreateGraph(item);int topstack= new intprojectnum; l= new intactivenum*2; e= new intactivenum*2; vl= new intprojectnum; ve= new intprojectnum;for (int i= 0; i projectnum; i+) vei= 0; for (int i= 0; i vek) vek= vej+ p.Period; if (graphick.ID= 0) topstack+rear= k; p= p.Next; if (m projectnum)return false; totaltime= veprojectnum- 1;for (int i= 0; i= 0; i-) j= topst