代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/214167/15112056
h d_bqueue.h
#ifndef ARRAY_BASED_QUEUE_CLASS
#define ARRAY_BASED_QUEUE_CLASS
#include "d_except.h"
using namespace std;
const int MAXQSIZE = 50;
template
class bqueue
{
public:
bqu
www.eeworm.com/read/214167/15112086
h d_pqueue.h
#ifndef MINI_PRIORITY_QUEUE_CLASS
#define MINI_PRIORITY_QUEUE_CLASS
#include
#include "d_heap.h"
#include "d_except.h"
using namespace std;
// maintain a priority queue containi
www.eeworm.com/read/214167/15112124
h d_lqueue.h
#ifndef LINKEDQUEUE_CLASS
#define LINKEDQUEUE_CLASS
#ifndef NULL
#include
#endif // NULL
#include "d_node.h" // node class
#include "d_except.h" // for underflowError exception
www.eeworm.com/read/214167/15112295
cpp prg9_2.cpp
// File: prg9_2.cpp
// the program tests the linkedQueue class by pushing
// the values in an array onto a queue. by using front()
// followed by pop(), the programs displays the contents
// of th
www.eeworm.com/read/212376/15157136
m goout.m
function [n,v,q]=goout(p)
% @QUEUE\GOOUT removes the first(the front) element from a queue.
% 调用格式
% goout(p) 从队列 p 中的第一个元素离队.
% v=goout(p) v 是从 p 队列中移出的那第一个元素的"值"
% [n,v]=goout(p) n,v
www.eeworm.com/read/211952/15169622
cpp p1361_bfs_hash.cpp
// zj1361.cpp : Defines the entry point for the console application.
//
#include
#include
bool map[20][20];
const int dr[4]={0,-1,0,1};
const int dc[4]={-1,0,1,0};
struct
www.eeworm.com/read/211952/15169913
cpp p2701_树的构造.cpp
#include
#include
#define MAXN 300
#define MAXM 30000
using namespace std;
struct TNode {
TNode * LeftChild , * RightBrother , * Father;
};
struct TEle
www.eeworm.com/read/211952/15169914
cpp p2701_树的构造stl版.cpp
#include
#include
#include
#include
#define MAXN 300
#define MAXM 30000
using namespace std;
typedef pair TQueue;
typedef set < TQueue
www.eeworm.com/read/211648/15176130
c traverse.c
/*图的遍历的演示（c 语言 数据结构课程设计题）*/
#define M 20
#include
#include
#include
/*定义图*/
typedef struct{
int V[M];
int R[M][M];
int vexnum;
}Graph;
/*
www.eeworm.com/read/210671/15193741
cpp fig20_25.cpp
// Fig. 20.25: fig20_25.cpp
// Testing Standard Library class priority_queue
#include
using std::cout;
using std::endl;
#include
int main()
{
std::priority_queue< d