数据结构Java版教学计划编排

package Sequence; import java.util.ArrayList; import java.util.Scanner; public class IAGraph implements Graph { private int vexCourseNum,arcPriorityNum;//课程数、边数 public int classHour; private int termNum ; private VNode[] vexs; ArrayList sHour = new ArrayList();//存储课时拓扑排序的结果 ArrayList courseName = new ArrayList();//存储课程名字 ArrayList data = new ArrayList();//存储课程拓扑排序的结果 public IAGraph() { create(); } public void create() { Scanner sc = new Scanner(System.in); System.out.println("1、请输入教学计划的课程总数："); vexCourseNum = sc.nextInt(); vexs =new VNode[vexCourseNum]; //创建 String [] s = new String [vexCourseNum]; int[] credit = new int[vexCourseNum]; System.out.println("2、请依次输入各个课程的名称:(以空格隔开)"); for (int i = 0; i < vexCourseNum; i++) { s[i] = sc.next(); courseName.add(s[i]); } System.out.println("3、请依次输入各个课程的学时(整数):(以空格隔开)"); for (int i = 0; i < vexCourseNum; i++) { credit[i] = sc.nextInt(); sHour.add(credit[i]); } for (int i = 0; i < vexCourseNum; i++) { vexs[i] = new VNode(courseName.toArray()[i],credit[i]); } System.out.println("4、请输入课程之间的关系总和，即有多少条边:"); arcPriorityNum = sc.nextInt(); System.out.println("5、请输入各条边的优先关系："); for(int k = 1;k <= arcPriorityNum;k++) { System.out.print("第"+k+"条边的前顶点："); int v = locateVex(sc.next()); System.out.print("第"+k+"条边的后顶点 ："); int u = locateVex(sc.next()); addArc(v,u); } System.out.println(); System.out.println("6、请输入学期总数："); termNum = sc.nextInt(); System.out.println("7、请输入每个学期学时上限："); classHour = sc.nextInt(); System.out.println("【*】拓扑排序如下："); } public void addArc(int v,int u) { ArcNode arc = new ArcNode(u); arc.nextArc = vexs[v].firstArc; vexs[v].firstArc = arc; } public int locateVex(Object vex) { for(int v =0; v < vexCourseNum;v++) { if(vexs[v].data.equals(vex)) return v; } return -1; } public Object getVex(int v) throws Exception{//返回v标识的节点的值 if(v<0 && v>=vexCourseNum) throw new Exception("第"+v+"个顶点不存在！"); data.add(vexs[v].data);// sHour.add(vexs[v].value); return vexs[v].getData(); } public void getInformation(int s,int v) { System.out.println("[课程名称]"+" "+"[学时]"+" "+"[先修课程]"+" "+"[后修课程]"); for(int i = s; i<v;i++) { if(i==0 && i!=vexCourseNum-1) System.out.println(data.get(i)+" "+sHour.get(i).toString()+" "+"NULL"+" "+data.get(i+1)); else if(i!=0 && i==vexCourseNum-1) System.out.println(data.get(i)+" "+sHour.get(i).toString()+" "+data.get(i-1)+" "+"NULL"); else if(i==0 && i==vexCourseNum-1) System.out.println(data.get(i)+" "+sHour.get(i).toString()+" "+"NULL"+" "+"NULL"); else System.out.println(data.get(i)+" "+sHour.get(i).toString()+" "+data.get(i-1)+" "+data.get(i+1)); } } public void getLastInformation() { System.out.println(data.get(vexCourseNum-1)+" "+sHour.get(vexCourseNum-1).toString()+" "+data.get(vexCourseNum-2)+" "+"NULL"); } public int getValue(int v) {//返回v标识的学时的值 if(v<0 && v>=vexCourseNum) return -1; return vexs[v].getValue(); } public int getTermNum() { return termNum; } public int getTermHour() { return classHour; } public int getVexNum() { return vexCourseNum; } public int getArcNum() { return arcPriorityNum; } public VNode[] getVexs() { return vexs; } }