ruan875417的专栏

SeqList.h#ifndef SEQLIST_H#define SEQLIST_H#includeconst int default_size = 100;//SeqListtemplateclass SeqList{public: typedef T value_type; typedef T* pointer; SeqList(int size = defaul

一、BFS#include#includeusing namespace std;const int max_num = 100;class BFS{public: typedef int VertexType; typedef int EdgeType; BFS(); void create_graph(); void bfs_traverse();private:

一、Dijkstra算法#includeusing namespace std;const int maxint = 10000;class Dij{public: void initial(int m, int n); void read_case(); void dijkstra(int begin, int end); void search_path(int begi

#includeusing namespace std;class AdjacencyMatrix{public: typedef int VertexType; typedef int EdgeType; AdjacencyMatrix(); ~AdjacencyMatrix(); void create_graph(); void print_graph();privat

#include#includeusing namespace std;//Trie树结点struct TrieNode{ bool is_string;//标记该结点处是否构成单词 TrieNode* next[26]; TrieNode() :is_string(false){ for (int i = 0; i < 26; i++) next[i] = NULL;

#includeusing namespace std;const int max_num = 500;const int max_len = 10000;typedef struct Edge{ int begin;//起点 int end;//终点 int weight;//权值 }Edge;class BellmanFord{public:

一、Prim算法#includeusing namespace std;const int max = 10000;class Hdu1233{public: void initial(int n); void read_case(); void prim(); void print_result();private: int path[101][101]; int d

#include#include#includeusing namespace std;class Hdu3342{public: void initial(int n, int m); void read_case(); bool topological_sort(); void print_result();private: vector vec[101];//节点的邻

#includeusing namespace std;void swap(int* a, int* b){ int temp = *a; *a = *b; *b = temp;}void bubble_sort1(int nums[],int len){ for (int i = 0; i < len; i++){ for (int j = len - 1; j>i; j

MyHeap.h#ifndef MY_HEAP_H #define MY_HEAP_H #include #include #define max_value -99999999 //仿函数 templatestruct MyLess{ bool operator()(const T& x, const T& y) const { return x < y

#includeusing namespace std;void merge(int* a, int* temp, int begin, int middle, int end){ int i = begin; int j = middle + 1; int k = 0; while (i <= middle&&j <= end){//比较两个指针所指向的元素，选择相对小的元素放入到

#includeusing namespace std;int pnumsrtition(int nums[], int low, int high){ int pivot_key = nums[low];//用区间的第1个记录作为基准 while (low < high){//从区间两端交替向中间扫描，直到low=high为止 while (low = pi

#includeusing namespace std;//求数据的最大位数int get_max_bit(int nums[], int len){ int count; int max = 1; int* temp = new int[len]; for (int i = 0; i < len; i++) temp[i] = nums[i]

#includeusing namespace std;typedef struct node{ int key; struct node* next; node(int k) :key(k), next(NULL){}}node;void bucket_sort(int nums[],int len,int bucket_size){ node** bucket_table

#include#includeusing namespace std;const int max_size = 50;struct HuffmanNode{ int weight;//weight表示权值数据域 int parent;//par=0表明结点是独立的，par>0为它的双亲下标 int lchild, rchild;//lchild, rchild为左

#includeusing namespace std;//已知二叉树前序遍历和中序遍历，求后序遍历void binary_tree_postorder(char* preorder,char* inorder,int length){ if (length == 0) return; char root = *preorder; int index = 0; for (; in

DualCirculationList.h#ifndef DUALCIRCULATIONLIST_H#define DUALCIRCULATIONLIST_H#include//list nodetemplatestruct list_node{ typedef list_node* pointer; T data; pointer prior; p

StaticLinkedList.h#ifndef STATICLINKEDLIST_H#define STATICLINKEDLIST_H#includeconst int max_size = 1000;//list nodetemplatestruct list_node{ T data; int cur;//cursor};//StaticLinkedList

SingleLinkedList.h#ifndef SINGLELINKEDLIST_H#define SINGLELINKEDLIST_H#include//list nodetemplatestruct list_node{ typedef list_node* pointer; T data; pointer next; list_node() :next(NULL)

SeqStack.h#ifndef SEQSTACK_H#define SEQSTACK_H#includeint default_size = 20;// SeqStacktemplateclass SeqStack{public: typedef T& reference; SeqStack(int size = default_size);//constructor

LinkedStack.h#ifndef LINKEDSTACK_H#define LINKEDSTACK_H#include//Stack nodetemplatestruct stack_node{ typedef stack_node* pointer; T data; pointer next; stack_node() :next(NULL){} stack_n

CircularQueue.h#ifndef CIRCULARQUEUE_H#define CIRCULARQUEUE_Hint default_size = 10;#include//CircularQueuetemplateclass CircularQueue{public: typedef T& reference; CircularQueue(int size

LinkedQueue.h#ifndef LINKEDQUEUE_H#define LINKEDQUEUE_h#include//queue nodetemplatestruct queue_node{ typedef queue_node* pointer; T data; pointer next; queue_node() :next(NULL){} queue_n

SeqDoubleStack.h#ifndef SEQDOUBLESTACK_H#define SEQDOUBLESTACK_H#includeint default_size = 20;// SeqDoubleStacktemplateclass SeqDoubleStack{public: typedef T& reference; SeqDoubleStack(int

一、用STL的queue实现MyStack.h#ifndef MYSTACK_H#define MYSTACK_H#include#include//MyStacktemplateclass MyStack{public: typedef T value_type; typedef T& reference; MyStack();//constructor ~MyS

一、用STL中的stack实现MyQueue.h#ifndef MYQUEUE_H#define MYQUEUE_h#include#include//MyQueuetemplateclass MyQueue{public: typedef T value_type; typedef T& reference; MyQueue();//constructor ~My

BinaryTree.h#ifndef BINARYTREE_H#define BINARYTREE_H#include#include#include//binary tree nodestruct binary_tree_node{ char data; binary_tree_node* lchild; binary_tree_node* rchild; binar

BinarySortTree.h#ifndef BINARYSORTTREE_H#define BINARYSORTTREE_H#include//binary sort tree nodestruct binary_sort_tree_node{ int data; binary_sort_tree_node* lchild; binary_sort_tree_node* rc

String.h#ifndef STRING_H#define STRING_H#define _CRT_SECURE_NO_WARNINGS#include//Stringclass String{public: String(const char* str = NULL);//constructor String(const String& rhs);//copy cons

#includeusing namespace std;int binary_search(int* data, int n, int key){ int low, high, mid; low = 0; high = n-1; while (low <= high){ mid = low + (high - low) / 2; if (key < data[mid])