10 2016 档案

摘要:// // main.cpp // BFS_cursive // // Created by 韩雪滢 on 10/23/16. // Copyright © 2016 韩雪滢. All rights reserved. // #include #include #define NUM_VERTEX 10 struct Vertex { char name; i... 阅读全文
posted @ 2016-10-23 19:58 ShellHan 阅读(254) 评论(0) 推荐(0)
摘要:我只是做了一点微小的工作,比如看了大神的代码然后加了注释,大神的原博客http://www.cnblogs.com/suncoolcat/p/3339508.html 阅读全文
posted @ 2016-10-23 16:20 ShellHan 阅读(227) 评论(0) 推荐(0)
摘要:#include typedef struct node { struct node *next; int vertex; }node; node *G[20]; //heads of linked list int visited[20]; int n; void read_graph(); //create adjacency list void insert... 阅读全文
posted @ 2016-10-23 11:43 ShellHan 阅读(193) 评论(0) 推荐(0)
摘要:// // main.c // BFS // // Created by 韩雪滢 on 10/23/16. // Copyright © 2016 韩雪滢. All rights reserved. // #include #include #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 ... 阅读全文
posted @ 2016-10-23 11:35 ShellHan 阅读(253) 评论(0) 推荐(0)
摘要:// // main.cpp // 1083_simpleAnswer // // Created by 韩雪滢 on 10/19/16. // Copyright © 2016 韩雪滢. All rights reserved. // #include #include #include #include using namespace std; int n,a[405];... 阅读全文
posted @ 2016-10-19 21:45 ShellHan 阅读(114) 评论(0) 推荐(0)
摘要:#include #include #include #include typedef struct bucket_item s_bucket_item; struct bucket_item{ int value; s_bucket_item * next; }; typedef struct bucket s_bucket; struct bucket{ s_buc... 阅读全文
posted @ 2016-10-15 21:45 ShellHan 阅读(152) 评论(0) 推荐(0)
摘要:// // main.c // binarySort // // Created by 韩雪滢 on 10/15/16. // Copyright © 2016 韩雪滢. All rights reserved. // //复杂度O(nlogn) #include int a[10]={21,56,43,12,3,99,56,23,2,12}; int main() { int... 阅读全文
posted @ 2016-10-15 20:45 ShellHan 阅读(1069) 评论(0) 推荐(0)
摘要:※ 求一个数组的长度 ※ 自定义结构的动态数组 ※求一个数的符号+/- 阅读全文
posted @ 2016-10-15 19:24 ShellHan 阅读(187) 评论(0) 推荐(0)
摘要:// // main.c // poj1050 // // Created by 韩雪滢 on 10/13/16. // Copyright © 2016 韩雪滢. All rights reserved. // #include #include #define MAXLEN 10000 /* poj1050 失败的小demo *其中包括 *读取一行字符串直到换行符 *将... 阅读全文
posted @ 2016-10-13 21:01 ShellHan 阅读(238) 评论(0) 推荐(0)