代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/249070/12523258
txt c13p744.txt
// ****************************************************
// Implementation file BFS.cpp
// A breadth-first search of the Graph class.
// ****************************************************
#includ
www.eeworm.com/read/249070/12523370
txt c07p350.txt
#include "QueueP.h"
int main()
{
Queue aQueue;
aQueue.enqueue(15);
return 0;
}
www.eeworm.com/read/249070/12523378
txt c07p359.txt
template
class queue
{
public:
explicit queue(const Container& cnt = Container());
// Default constructor, initializes an empty queue.
// Precondition:
www.eeworm.com/read/249070/12523613
txt c11p642b.txt
w#include
#include
#include
#include
#include
using namespace std;
int main()
{
//declare a priority queue
priority_queue pq;
www.eeworm.com/read/249070/12523911
cpp bfs.cpp
// ****************************************************
// Implementation file BFS.cpp
// A breadth-first search of the Graph class.
// ****************************************************
#includ
www.eeworm.com/read/249070/12524282
cpp example350.cpp
#include "QueueP.h"
int main()
{
Queue aQueue;
aQueue.enqueue(15);
return 0;
}
www.eeworm.com/read/335381/12531489
htm que_0953.htm
queue
Click on the banner to return to the Class Reference home page.
©Copyright 1996
www.eeworm.com/read/335381/12531689
htm que_3605.htm
The Queue Data Abstraction
Click on the banner to return to the user guide home page.
www.eeworm.com/read/147693/12538705
pl fig7_4.pl
% Figure 7.4 An implementation of the findall relation.
findall( X, Goal, Xlist) :-
call( Goal), % Find a solution
assertz( queue(X) ), % Assert i
www.eeworm.com/read/147425/12552413
cpp fb.cpp
#include
#define MAXQSIZE 20
typedef struct
{
int elem[MAXQSIZE]; //静态分配
int front ;
int rear ;
}Queue;
void fb(int k, int max, Queue &cq)
{