代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/273268/10921505
cpp ex7_11.cpp
//【例7.11】链队类模板。
#include
#include
using namespace std;
templateclass Queue;
templateclass Node{
T info;
Node *link; //在类模板Node中使用指向Node的指针可以不加
www.eeworm.com/read/273268/10921575
cpp ex7_10.cpp
//【例7.10】顺序存储方式的循环队列类模板。
#include
#include
using namespace std;
templateclass Queue{
int rear,front; //队尾与队头
T *elements; //存放队列元素的容器
int max
www.eeworm.com/read/272944/10935940
cpp tree.cpp
#include "iostream.h"
#include "stdio.h"
#include "malloc.h"
typedef struct TNode
{
char data;
struct TNode *child;
struct TNode *brother;
}TNode,*Tree;
void CreateTree(Tre
www.eeworm.com/read/418675/10936220
cpp test.cpp
#include
#include "DList.h"
#include "Queue.h"
#include "Stack.h"
#include "BTree.h"
using namespace std;
using namespace SSDataS;
int main()
{
int i = 0;
int temp = 0;
www.eeworm.com/read/272894/10936749
dpr ex.dpr
{
BFS
}
program Ural_1325(Input,Output);
const
Direction:array[1..8]of record
x,y:ShortInt;
end=((x:1;y:1),(x:1;y:-1),(x:-1;y:1),(x:-1;y:-1),(x:1;y:0),(x:0;y:1),(x:-1;y:0),(x:0;y:-1));
M
www.eeworm.com/read/272894/10936961
dpr ex_bfs.dpr
program Ural_1371(Input,Output);
const
MaxN=50000;
MaxM=MaxN*2;
type
TIndex=Longint;
TData=Int64;
TUsed=array[1..MaxN]of Boolean;
TLast=array[1..MaxN]of TIndex;
TEdge=array[1..MaxM]of
www.eeworm.com/read/272894/10937054
dpr ex.dpr
{
this problem can use Dijkstra
but i use BFS
note: the shown number of exchange plate must be in current plate.
but the hidden number of exchange plate needn't be in current plate.
}
prog
www.eeworm.com/read/272894/10937313
dpr ex.dpr
program Ural_1314(Input,Output);
const
MaxID=32767;
MaxEdge=2500*2;
type
TIndex=Longint;
TLast=array[1..MaxID]of TIndex;
TPrev=array[1..MaxEdge]of TIndex;
TToPtr=array[1..MaxEdge]of TInd
www.eeworm.com/read/272848/10940501
h linkedqueue.h
// linked implementation of a queue
// derives from the ADT queue
#ifndef linkedQueue_
#define linkedQueue_
#include "queue.h"
#include "chainNode.h"
#include "myExceptions.h"
#include
www.eeworm.com/read/272848/10941412
h arrayqueue.h
// circular array implementation of a queue
// derives from the ADT queue
#ifndef arrayQueue_
#define arrayQueue_
#include "queue.h"
#include "myExceptions.h"
#include
using nam