<li id="ma4w8"></li> <strike id="ma4w8"></strike>
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽： Multiplicative undirected Shortest measured
上傳時間： 2017-04-08
上傳用戶：邶刖
The files adi_ssl_init.h and adi_ssl_init.c are used to define the functions adi_ssl_Init() and 慳di_ssl_Terminate()?which initialize and terminate all the Blackfin System Services in the appropriate order, for a particular EZ-Kit, depending on the Blackfin processor used.
標簽： adi_ssl_init adi_ssl_Init functions define
上傳時間： 2014-01-21
上傳用戶：sammi
======================================================================== MICROSOFT FOUNDATION CLASS LIBRARY : SimpleExtMFC ======================================================================== AppWizard has created this SimpleExtMFC application for you. This application not only demonstrates the basics of using the Microsoft Foundation classes but is also a starting point for writing your application. This file contains a summary of what you will find in each of the files that make up your SimpleExtMFC application.
上傳時間： 2017-04-21
上傳用戶：daguda
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
標簽： OTSU segmentation Gray-level segmented
上傳時間： 2017-04-24
上傳用戶：yuzsu
If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advancement of what has come to be called subjective idealism. He wrote a number of works, of which the most widely-read are Treatise Concerning the Principles of Human Knowledge (1710) and Three Dialogues between Hylas and Philonous (1713) (Philonous, the "lover of the mind," representing Berkeley himself).
標簽： there classic forest nobody
上傳時間： 2013-11-26
上傳用戶：stvnash
簡介 JavaEE在開發的時候，如果是系統內部常量，一般提倡用枚舉常量類，寫在單獨的類中，但是經常要修改的變量,比如數據源配置，如果存在數據庫中，有種浪費。但是存在TXT中擴展性不好，就筆者觀察，一般的程序員都喜歡把經常修改的常量存在xml文件或者properties文件。 存在xml文件最大的好處是擴展性很好，一般用sax或者dom這兩個方向的框架，比如DOM4J,JDOM等。Sun推出的JAXM(Java API for XML Messaging)也是用的DOM4J。由于SAX的處理方式類似流媒體，是逐行的，不需要全部加載。而DOM是全部加載在內存，生成樹。因而SAX的讀取比DOM性能好，但是修改的話DOM略勝一籌。properties文件的擴展性不如xml，但是有很多xml沒法實現的優勢，比如加密之類的~ Helloworld 筆者根據自己開發中感受，寫了一個工具包，用來體現讀取xml或者properties的流程，大家在使用的時候記得修改文件路徑。一共包含五個文件.本demo主要是用來模擬讀取數據庫的賬戶和密碼的，讀者可以在此基礎上擴展。
標簽： JavaEE
上傳時間： 2017-05-31
上傳用戶：change0329
Introduction to I/O Kit Device Driver Design Guidelines Chapter 1 The libkern C++ Runtime Chapter 2 libkern Collection and Container Classes Chapter 3 The IOService API Chapter 4 Making Hardware Accessible to Applications Chapter 5 Kernel-User Notification Chapter 6 Displaying Localized Information About Drivers Chapter 7 Debugging Drivers Chapter 8 Testing and Deploying Drivers Chapter 9 Developing a Device Driver to Run on an Intel-Based Macintosh
標簽： Chapter Introduction Guidelines Runtime
上傳時間： 2017-07-04
上傳用戶：冇尾飛鉈
Tic tac toe is (exactly what re your thinking) and it s the first game I made. Made it in one whole day in Turbo C. It uses primitive graphics drawing and also demonstrates how to output an image. Written in C, also uses a library I got from the net (included) for image output.
標簽： thinking exactly first whole
上傳時間： 2017-08-13
上傳用戶：xhz1993
Implements mixture of binary (logistic) PCAs where pixels are modeled using Bernoulli distributions instead of Gaussian. The images do not need to be aligned.
標簽： distributions Implements Bernoulli logistic
上傳時間： 2013-12-26
上傳用戶：xiaoyunyun
