文件名称:wanshell
介绍说明－－下载内容均来自于网络，请自行研究使用
warshall法顺序：置新矩阵，开始运算；置i=1；对所有j如果A[j,i]=1，则对k=1,2,3……n运算啊A[j,k]:=A[j,k]+A[i,k]；
i++；如果i<=n转上继续
需要：
1.输入矩阵，用二维数组，可以考虑全局变量
2.设置矩阵最大值nMax
3.对i从0到n-1循环，寻找每列为1的项，为1则继续运算，否则返回
增强说明：
1.输入方式选择，同时可以选择是否继续运算
2.不再每行确认，增加修改选项
3.使用字符串数组，可直接输出得到的结果-warshall law order: a new matrix set to begin operation set i = 1 for all j if A [j, i] = 1, then for k = 1,2,3 ... ... n operation ah A [j, k]: = A [j, k]+ A [i, k] i++ if i < = n turn on the continuing need: 1. Enter the Matrix, with two-dimensional array, we can consider global variables 2. set matrix maximum nMax 3. for i from 0 to n-1 loop, as 1 per item to find, as a continuing operation, otherwise enhance: 1. input choice and can choose whether to continue operations 2. not confirm each line to increase modified option 3. use an array of strings, the result can be directly output
i++；如果i<=n转上继续
需要：
1.输入矩阵，用二维数组，可以考虑全局变量
2.设置矩阵最大值nMax
3.对i从0到n-1循环，寻找每列为1的项，为1则继续运算，否则返回
增强说明：
1.输入方式选择，同时可以选择是否继续运算
2.不再每行确认，增加修改选项
3.使用字符串数组，可直接输出得到的结果-warshall law order: a new matrix set to begin operation set i = 1 for all j if A [j, i] = 1, then for k = 1,2,3 ... ... n operation ah A [j, k]: = A [j, k]+ A [i, k] i++ if i < = n turn on the continuing need: 1. Enter the Matrix, with two-dimensional array, we can consider global variables 2. set matrix maximum nMax 3. for i from 0 to n-1 loop, as 1 per item to find, as a continuing operation, otherwise enhance: 1. input choice and can choose whether to continue operations 2. not confirm each line to increase modified option 3. use an array of strings, the result can be directly output
(系统自动生成,下载前可以参看下载内容)
下载文件列表
wanshell.cpp