bai071006201的专栏

技术菜鸟

Help Captain Chen Ⅰ

Description Recently, more and more students pay attention to a funny game called ACM, including Captain Chen. He finds that to compete in t...

2013-03-22 09:57:26

阅读数:383

评论数:0

flody

参考文献 #include using namespace std; int MAX_DIS=999; int graph[50][50]; int dis[50][50]; int path[50][50]; int n; void flody() { int i,j,k; for(k...

2013-03-21 14:45:53

阅读数:435

评论数:0

并差集

Description Do you know a software called "WeiXin", a kind of chatting tool? There is an application called "Shaking for a while&qu...

2013-03-20 14:07:05

阅读数:339

评论数:0

poj 1068

#include #include #include #include #include using namespace std; void run(int a[],int t) { int i,j; vector vs; int visited[110]={0}; stack ss; ...

2013-03-19 15:37:56

阅读数:280

评论数:0

1328

#include #include using namespace std; float min(float a,float b) { return a<b?a:b; } int main() { int n,d; float a[1001][3]; float dis[1001][...

2013-03-17 20:31:58

阅读数:258

评论数:0

图的深度搜索完整实现(邻接表,DFS)

//构造邻接表,深度优先搜索 #include #include #define null NULL using namespace std; typedef struct nd { int key; struct nd * next; }node; typedef struct ndl { ...

2013-03-12 16:13:01

阅读数:285

评论数:0

图的广度搜索完整实现(邻接表,队列,BFS)

//构造邻接表,队列,广度优先搜索 #include #include #define null NULL using namespace std; typedef struct nd { int key; struct nd * next; }node; typedef struct ndl...

2013-03-12 15:41:03

阅读数:353

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭