广度优先搜索 C++ 代码
广度优先搜索 C++ 代码
#include <iostream>using namespace std;struct node {int info;node *next;};class Queue {public:Queue();~Queue();bool isEmpty();void add(int);int get();private:node *first, *last;};class Graph {public:Graph(int size = 2);~Graph();bool isConnected(int, int);// adds the (x, y) pa ...