<abbr id="mqw2y"></abbr> 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.
標(biāo)簽： fault-tolerant algorithms redundant underlyin
上傳時(shí)間： 2013-12-18
上傳用戶：jkhjkh1982
This document contains a general overview in the first few sections as well as a more detailed reference in later sections for SVMpython. If you re already familiar with SVMpython, it s possible to get a pretty good idea of how to use the package merely by browsing through svmstruct.py and multiclass.py. This document provides a more in depth view of how to use the package. Note that this is not a conversion of SVMstruct to Python. It is merely an embedding of Python in existing C code. All code other than the user implemented API functions is still in C, including optimization.
標(biāo)簽： document contains detailed overview
上傳時(shí)間： 2013-12-14
上傳用戶：希醬大魔王
Head First 設(shè)計(jì)模式(中文_文字版)
標(biāo)簽： First Head 設(shè)計(jì)模式
上傳時(shí)間： 2013-07-19
上傳用戶：eeworm
Head.First.設(shè)計(jì)模式.中文版
標(biāo)簽： First Head 設(shè)計(jì)模式
上傳時(shí)間： 2013-07-01
上傳用戶：eeworm
在深入了解Flash存儲(chǔ)器的基礎(chǔ)上，采用單片機(jī)自動(dòng)檢測(cè)存儲(chǔ)器無效塊。主要通過讀取每一塊的第1、第2頁(yè)內(nèi)容，判斷該塊的好壞，并給出具體的實(shí)現(xiàn)過程，以及部分關(guān)鍵的電路原理圖和C語(yǔ)言程序代碼。該設(shè)計(jì)最終實(shí)現(xiàn)單片機(jī)自動(dòng)檢測(cè)Flash壞塊的功能，并通過讀取ID號(hào)檢測(cè)Flash的性能，同時(shí)該設(shè)計(jì)能夠存儲(chǔ)和讀取1GB數(shù)據(jù)。 Abstract: On the basis of in-depth understanding the Flash chips，this paper designs a new program which using the SCM to detect the invalid block.Mainly through reading the data of the first and second page to detect the invalid block.Specific implementation procedure was given,and the key circuit schematic diagram and C language program code was introduced.This design achieved the function of using the MCU checks the invalid block finally，and increased the function by reading the ID number of Flash to get the performance of the memory.And the design also can write and read1GB data
標(biāo)簽： Flash 單片機(jī) 存儲(chǔ)器 自動(dòng)檢測(cè)
上傳時(shí)間： 2013-10-25
上傳用戶：taozhihua1314
是有關(guān)編譯原理的,可以自動(dòng)對(duì)輸入的??分析,生成first集和follow集
上傳時(shí)間： 2013-12-26
上傳用戶：onewq
TheTool is highy customizable map editor(based on QT) which can be extended via LUA scripts. A first implentation is ready and can be published to the public. The editor is the perfect tool who wants to design some 3d games but don t have time to write
標(biāo)簽： customizable extended TheTool scripts
上傳時(shí)間： 2013-12-12
上傳用戶：lanwei
objects first with java: a practical introduction using bluej 英國(guó)愛丁堡大學(xué)java教程源代碼
標(biāo)簽： java introduction practical objects
上傳時(shí)間： 2015-02-03
上傳用戶：ggwz258
Your First Cup of Java，初學(xué)者的第一杯咖啡。
上傳時(shí)間： 2013-12-10
上傳用戶：cjf0304
This is the first ever open source implementation of Dynamic Host Configuration Protocol for IPv6 (DHCPv6) server and client on Linux Operating System. The server provides leases (durations or lifetimes) on IPv6 addresses to the clients who request for it
標(biāo)簽： implementation Configuration Protocol Dynamic
上傳時(shí)間： 2015-02-28
上傳用戶：希醬大魔王
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<bdo id="2o4ko"></bdo>
<pre id="2o4ko"></pre> <input id="2o4ko"></input>