图的广度搜索完整实现(邻接表,队列,BFS)
//构造邻接表,队列,广度优先搜索#include#include#define null NULLusing namespace std;typedef struct nd{ int key; struct nd * next;}node;typedef struct ndl{ int count; node * first;}nodelist;typedef st