C++

This version is coming soon, but yeah is still running. The idea is to record all the prefixes of words to reduce the number of scans. My implementation method is to create a new file to store all the prefixes of all words, and then add the same

/* Queue. C -- queue implementation file */ # include "queue. H " /* local function declaration */ static queuenode * makenode_q (const item ); /* interface function definition */ bool initialize_q (queue * const PQ) { * PQ = (struct queue *)

I have written it before. This time, I decided to write it. If I don't write anything, my head will be stupid. All the things I use are in the previous figure. I want to talk about it. I will use STL + DLL to write it soon. Come on. // Graph. CPP

RecentCodeThe low output makes me feel guilty! When I get home, I always want to go to bed, and I feel very tired. It is also true that I am tired recently. It may also be because I always think that I will get tired... Adjustments and adjustments

// 13-1.h # include namespace binarysearchtree { typedef int item; typedef struct node { item; struct node * left, * right; } node; class binarysearchtree { PRIVATE: node * m_root; int m_current; node * m_makenode (const item & item);

I am so depressed that I haven't updated my blog for so long. Sin, sin... I wrote a model for this extensible column. It has many limitations and has very strong limitations, about 32: 1. haha. however, even so, it is very helpful for anyone who

2-D tree, written yesterday. I wanted to have a good time playing the ball today. I don't want to play for a short time, so I came to the Internet. This feature supports two-dimensional range search and is very useful. I do not acknowledge the

/* Uiversal_queue.h -- queue header file */ # include "head. H " /* define data type */ typedef struct node { item; struct node * Next; } node; typedef struct queue { node * front; node * rear; int current; } * queue; /* proclaim interface

... The latest works are really pitiful. But fortunately, it is better than not. This is an example of the divide and conquer algorithm. It is implemented according to the idea. In general, it is not bad. I hope that the next step will be more

Path search: when the target node is searched, it is regarded as a path. There are no two consistent paths, but two different paths can have the same part. The function definition is also provided. //2011-08-19-21.14 -- 2011-08-19-21.36 by

Said that I had been in touch with this thing six months ago. I contacted again yesterday and found that the method provided in the book is very good. go to DFS and follow the completion time, that is, run the DFS command again on the transformed

I haven't studied it for several days . to be honest, it's quite uncomfortable. I like algorithm issues very much and then write code. it is easy to write. besides, this is very important to me.I don't have that much time to repeat it. at least now.

  // Graphrepresentasadjacentlist. H -- Graph header file. // 2011-08-28-20.26 -- // purpose: // define a class "graphrepresentasadjacentlist ". // declare methods of the class, and define element member. # include # include # include "binaryheap.

//queue.h#ifndef QUEUE_H_#define QUEUE_H_#include templateclass Queue ;templatestd ::ostream & operator & queue){os * scan = queue.m_head ;while (scan != NULL){os m_item m_next ;}os " ;return os ;}templatestd ::istream & operator >> (std ::istream

  //queue.cpptemplatevoid Queue ::m_copyElement (const Queue &queue){QueueItem * scan = queue.m_head ;while (scan != NULL){push(scan ->m_item) ;scan = scan ->m_next ;}}template templatevoid Queue ::m_copyElement (Iter beg, Iter end){while (beg !=

  //graphRepresentAsAdjacentList.cpp -- mplement file#include "stdafx.h"#include "graphRepresentAsAdjacentList.h"//Purpose://Define methods of class "graphRepresentAsAdjacentList".//Private methods://---------------------graphRepresentAsAdjacentList

I did not write anything for a month, because I spent more energy on C ++. starting from January 1, May 4, it will be a month now. although I have not finished learning, I can write something like a binary search tree. There are many new features

This is a new learning. Although I have learned a picture in the previous book, I still haven't learned this problem. This time, I learned it. I wrote it two days ago and two days later. Recently, the main focus has been on C ++ and and linear

// Intervaltree. CPP -- Interval Tree implementation file # include "stdafx. H " # include" intervaltree. H " namespace tree { // Private: bool intervaltree: m_overlap (const item min, const item max) const { If (m_min { If (Min return true;

I used a class template. I don't know if this is an extra step. The exercise is the main one. //graphRepresentAsAdjacentMatrix.h --graph header file.//Purpose://A graph represent as a adjacent matrix, this graph can't storage //weight value instead