Skip to content

Conversation

@MineFi
Copy link
Contributor

@MineFi MineFi commented May 25, 2017

提交求图的任意两点间最短路径的算法。


Status InitTestGraph(Graph* G) //��ʼ��ͼ
{
G->matrix[0][1] = 1;
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  • 一个循环就能搞定,这样写多不好看啊


//����ͼ�Ľṹ�Լ���صIJ�������

#define MAX 20 //��󶥵����
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  • 这些全局定义统一放到最上面会更美观

@@ -0,0 +1,11 @@
8, 3, 1, 6, 4, 5, 7, 10, 14, 19, 22, 30
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  • 程序中没有看到C语言文件流相关操作,这个结果输出是手工复制的吗? 建议使用C语言文件操作,自动把查找结果输出到文件中

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

= =,不好意思理解错了,结果确实是自己复制的.... 修改后会重新提交

@MineFi
Copy link
Contributor Author

MineFi commented Jun 5, 2017

按师哥要求修改后再次提交

@MineFi MineFi closed this Jun 12, 2017
@MineFi
Copy link
Contributor Author

MineFi commented Jun 12, 2017

按要求修改后再次提交

@MineFi MineFi reopened this Jun 12, 2017
Micylt added 2 commits June 30, 2017 23:58
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants