bfs + dfs
楚江枫
不忘初心,方得始终
展开
-
【数据结构作业 链表 + BFS + DFS】
代码:#include<iostream> using namespace std; struct node{ int a; node *next; }; typedef struct node1{ char s; node *f; }node1,st[110]; struct node2{ st ss; int vm,vn; }; struct que{原创 2017-05-19 17:36:00 · 441 阅读 · 0 评论 -
【非递归实现 BFS】 + 栈
代码:#include<iostream> using namespace std; int vis[110]; struct node{ int a; node *next; }; typedef struct node1{ char s; node *f; }st[110]; struct node2{ st ss; int vn,vm; }; str原创 2017-05-19 22:04:54 · 741 阅读 · 0 评论 -
【FZUoj 2283 Tic-Tac-Toe】& dfs & 博弈
Problem 2283 Tic-Tac-Toe Accept: 159 Submit: 340 Time Limit: 1000 mSec Memory Limit : 262144 KB Problem Description Kim likes to play Tic-Tac-Toe. Given a current state, and now Kim is goin原创 2017-08-21 22:08:36 · 493 阅读 · 0 评论