Visual C++ Windows Shell Programming Welcome to Visual C++ Windows Shell Programming! With this book, you ll learn how to program the Windows Shell, customize its behavior and integrate your applications with it. You ll discover how to use and modify its features to best effect, and the way to call shell API functions whose documentation is scant. Programming the shell isn t difficult, but few books explain the subject in its entirety.
標簽： Programming Windows Visual Shell
上傳時間： 2014-11-27
上傳用戶：zhangjinzj
Floyd-Warshall算法描述 1)適用范圍： a)APSP(All Pairs Shortest Paths) b)稠密圖效果最佳 c)邊權可正可負 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法結束：dis即為所有點對的最短路徑矩陣 3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。 考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
標簽： Floyd-Warshall Shortest Pairs Paths
上傳時間： 2013-12-01
上傳用戶：dyctj
選擇第k小的元素，c語言 partition 要好好看看 理解函數意思
標簽： 元素
上傳時間： 2016-02-19
上傳用戶：ukuk
加權k均值算法，或者稱為加權C均值聚類算法
上傳時間： 2016-02-26
上傳用戶：TF2015
生成一個單向鏈表（*pListHead） 用C中的結構體或C++中的類實現 完成基本要求 基本算法要求： 實現對鏈表的逆序 void reverse（CList& ）； 查找鏈表倒數第k個元素 FindFBack（CList&， int k）； 高要求： 對鏈表排序 order（CList&）； 判斷單向鏈表是否有環
標簽： pListHead reverse CList void
上傳時間： 2014-12-07
上傳用戶：wlcaption
The market for miniature computer programming is exploding. C++ Footprint and Performance Optimization supplies programmers the knowledge they need to write code for the increasing number of hand-held devices, wearable computers, and intelligent appliances. This book gives readers valuable knowledge and programming techniques that are not currently part of traditional programming training. In the world of C++ programming, all other things being equal, programs that are smaller and faster are better. C++ Footprint and Performance Optimization contains case studies and sample code to give readers concrete examples and proven solutions to problems that don t have cut and paste solutions.
標簽： Performance programming Optimizati Footprint
上傳時間： 2013-12-09
上傳用戶：wfl_yy
簡單的floyd運用 第一行輸入一個整數C。C是測試的情況（0< C <=30）.第二行一個正整數N( 0< N <=100),表示道路的總數.緊接N行，每一行包含兩個字符串， Si,，Ti，和一個整數Di,代表從Si到Ti的距離(0<= Di <=150)。最后一行有兩個字符串，S 和 T，你得找出從S 到 T的最短的距離。地名是不超過120個小寫字符的串（從‘a’到‘z’)。假設這里最多有100條直接連通兩個地方的路。 Output 輸出包含C行，每一行對一種測試情況。對每一種測試情況，輸出包含一個整數，假如S 到 T存在一條最短的路,輸出從S到T的最短距離,否則輸出“-1”. Sample Input 2 2 jiuzhouriver liuchi 89 liuchi liyuan 100 liuchi jiuzhouriver 3 youyongchi fengyuan 100 qinshi meiyuan 100 chaochang supermarkt 100 meiyuan youyongchi Sample Output 89 -1
上傳時間： 2016-03-10
上傳用戶：wyc199288
C++讀取Excel AppWizard uses "TODO:" to indicate parts of the source code you should add to or customize. If your application uses MFC in a shared DLL, and your application is in a language other than the operating system s current language, you will need to copy the corresponding localized resources MFC42XXX.DLL from the Microsoft Visual C++ CD-ROM onto the system or system32 directory, and rename it to be MFCLOC.DLL. ("XXX" stands for the language abbreviation. For example, MFC42DEU.DLL contains resources translated to German.) If you don t do this, some of the UI elements of your application will remain in the language of the operating system.
標簽： AppWizard indicate custom source
上傳時間： 2016-03-12
上傳用戶：cazjing
高效的k-means算法實現，使用了k-d樹與局部搜索等提高k-means算法的執行效率，同時包含示例代碼，用c++代碼實現。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
上傳時間： 2016-03-28
上傳用戶：yulg
SAS是功能強大的統計軟體，其程式碼有8成是用C所開發。此檔案提供豐富的SAS SQL程式碼，可幫助你解決相關的資料問題問題。
標簽： SAS
上傳時間： 2014-11-24
上傳用戶：sevenbestfei
