Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
A general technique for the recovery of signi cant image features is presented. The technique is based on the mean shift algorithm, a simple nonparametric pro- cedure for estimating density gradients. Drawbacks of the current methods (including robust clustering) are avoided. Feature space of any nature can be processed, and as an example, color image segmentation is dis- cussed. The segmentation is completely autonomous, only its class is chosen by the user. Thus, the same program can produce a high quality edge image, or pro- vide, by extracting all the signi cant colors, a prepro- cessor for content-based query systems. A 512 512 color image is analyzed in less than 10 seconds on a standard workstation. Gray level images are handled as color images having only the lightness coordinate
標(biāo)簽： technique presented features recovery
上傳時(shí)間： 2015-10-14
上傳用戶：410805624
Writing Your First ASP Application ( Quick Start ) (Page 1 of 8 ) There are many tutorials out there that show you how to program in ASP. Some of them are good, and some are bad. Some of them are downright terrible. In any case, you ve read a bit about ASP and now you are ready to build your first application. But where do you start? In my own experience, I have found that I find it easier to learn something if I actually work with it hands-on. Just reading a book or documentation doesn’t give you the practical knowledge you need to be able to rush off and start creating applications. In this article, I will discuss the creation of a very simple application. I will cover what the application will do, how we will approach writing it, demonstrate in code how we will do it, and discuss additional features that could be added to it. Writing Your First ASP Application ( Quick Start ) - Users On Your Website
標(biāo)簽： Application tutorials Writing First
上傳時(shí)間： 2015-11-05
上傳用戶：franktu
The ability to write efficient, high-speed arithmetic routines ultimately depends upon your knowledge of the elements of arithmetic as they exist on a computer. That conclusion and this book are the result of a long and frustrating search for information on writing arithmetic routines for real-time embedded systems. With instruction cycle times coming down and clock rates going up, it would seem that speed is not a problem in writing fast routines. In addition, math coprocessors are becoming more popular and less expensive than ever before and are readily available. These factors make arithmetic easier and faster to use and implement. However, for many of you the systems that you are working on do not include the latest chips or the faster processors. Some of the most widely used microcontrollers used today are not Digital Signal Processors (DSP), but simple eight-bit controllers such as the Intel 8051 or 8048 microprocessors.
標(biāo)簽： arithmetic high-speed ultimately efficient
上傳時(shí)間： 2014-11-30
上傳用戶：lizhen9880
Subroutine MCHOLSK :To solves a hermitian positive definite set of complex linear simultaneous equations (AX=B) using the Cholesky decomposition method.
標(biāo)簽： simultaneous Subroutine hermitian definite
上傳時(shí)間： 2014-08-25
上傳用戶：windwolf2000
What Does the code DO? Sometimes we may desire to hide our file contents from others.One of the possible way is encrypting these files.Here a simple encryption technique is used(In VB - The same technique can be implemented in "c" also.) Program flow Explained * Open the File to be encrypted for Binary Access Read(Say Source File) * Open a temparory file where encrypted data is stored for Binary Access Write(Say Destination File) * Loop through the Source File Byte by Byte * For each byte read from the file, Complement the data. (Using Not operator (in C we have to use "~" operator) * Write Complemented Data to Destination File * Delete the Source File * Rename Destination file as Source File(Now Encryption is over)
標(biāo)簽： Sometimes the contents desire
上傳時(shí)間： 2013-12-25
上傳用戶：playboys0
Networking for Dummies 8th Edition ,Written for even the most network-shy novice, this book begins with the most basic of basics and progresses through all the essentials, from cables, routers and hubs to building a wireless network.英文版 CHM格式
標(biāo)簽： network-shy Networking for Dummies
上傳時(shí)間： 2015-12-16
上傳用戶：shus521
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標(biāo)簽： represented integers group items
上傳時(shí)間： 2016-01-17
上傳用戶：jeffery
The Linux Enterprise Cluster explains how to take a number of inexpensive computers with limited resources, place them on a normal computer network, and install free software so that the computers act together like one powerful server. This makes it possible to build a very inexpensive and reliable business system for a small business or a large corporation. The book includes information on how to build a high-availability server pair using the Heartbeat package, how to use the Linux Virtual Server load balancing software, how to configure a reliable printing system in a Linux cluster environment, and how to build a job scheduling system in Linux with no single point of failure. The book also includes information on high availability techniques that can be used with or without a cluster, making it helpful for System Administrators even if they are not building a cluster. Anyone interested in deploying Linux in an environment where low cost computer reliability is important will find this book useful.
標(biāo)簽： inexpensive Enterprise computers explains
上傳時(shí)間： 2014-11-29
上傳用戶：zhangliming420
This fourth edition of the definitive reference to JavaScript, a scripting language that can be embedded directly in web pages, covers the latest version of the language, JavaScript 1.5, as supported by Netscape 6 and Internet Explorer 6. The book also provides complete coverage of the W3C DOM standard (Level 1 and Level 2), while retaining material on the legacy Level 0 DOM for backward compatibility
標(biāo)簽： JavaScript definitive reference scripting
上傳時(shí)間： 2013-12-25
上傳用戶：xuanchangri
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
