Location:
Search - reachable
Search list
Description: John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants.。。。。Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught
Platform: |
Size: 9927 |
Author: 谭晓彤 |
Hits:
Description: A bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its current position and two bishops attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for bishop B1 form its current position. The figure also shows that the bishops B1 and B2 are in attacking positions whereas B1 and B3 are not. B2 and B3 are also in non-attacking positions
Platform: |
Size: 1154 |
Author: 文龙武 |
Hits:
Description: John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants.。。。。Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught-John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road . John starts at lake 1, but he can finish at any lake he wants.. . . . Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught
Platform: |
Size: 9216 |
Author: 谭晓彤 |
Hits:
Description: A bishop is a piece used in the game of chess which is played on a board of square grids. A bishop can only move diagonally from its current position and two bishops attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for bishop B1 form its current position. The figure also shows that the bishops B1 and B2 are in attacking positions whereas B1 and B3 are not. B2 and B3 are also in non-attacking positions
Platform: |
Size: 1024 |
Author: 文龙武 |
Hits:
Description: Ping is an old Unix utility which is pretty useful even today. The basic idea behind Ping is to find out whether the network is reachable and alive or not. Ping basically sends an ICMP echo request and then waits for an ICMP echo response the roundtrip time is calculated from the time at which the request was sent and the time at which a response is received. For more information on ICMP, please see RFC 792. -Ping is an old Unix utility which is pretty useful even today. The basic idea behind Ping is to find out whether the network is reachable and alive or not. Ping basically sends an ICMP echo request and then waits for an ICMP echo response the roundtrip time is calculated from the time at which the request was sent and the time at which a response is received. For more information on ICMP, please see RFC 792.
Platform: |
Size: 19456 |
Author: 黄海栋 |
Hits:
Description: lfsThe LFS FTP archive has been moved to a new server which is reachable under the na
packages.linuxfromscratch.org. The reason for the move is that this new server sits on
lot more bandwidth to spare.-lfs6.3The LFS FTP archive has been moved to a new server which is reachable under the na
packages.linuxfromscratch.org. The reason for the move is that this new server sits on
lot more bandwidth to spare.
Platform: |
Size: 350208 |
Author: dfdsfd |
Hits:
Description: 轮询局域网内的IP地址是否可达，并有图形界面。内有注释。-Polling LAN IP address is reachable or not, and graphical interface. There are notes.
Platform: |
Size: 100352 |
Author: xiaodou |
Hits:
Description: 1. 用ＤＦＳ判断一个无向图是否是连通图；
2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边；
3. 用ＤＦＳ和点消除求有向图的拓扑排序；
4. 判断有向图是不是强连通图，若不是，求强连通分量；
5. 判断有向图是不是半连同图；
6. 判断有向图是不是单连通图；
7. 判断无向图是不是双连通图。
通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。
-1. Using DFS to test if a given undirected graph is connected or not.
2. Classify the edges of a directed graph into tree edges, back edges, forward edges or cross edges by a depth-first traversal of the graph. If the given graph is undirected, classify the edges into tree edges and back edges. And verify if a directed or undirected graph has a cycle.
3. Compute the topological order of a directed graph using both DFS algorithm and source removal algorithm.
4. A strongly connected graph is a directed graph with every pair of vertices reachable from each other. A strongly connected component C of a directed graph G is a subset of maximal vertices such that every pair of vertices in the subset are reachable from each other. A strongly connected component graph GSCC of a graph G is a directed graph that each component C of G is considered as a single vertex in GSCC and there is an edge between components C1 and C2 if there exist an edge (u, v) in the graph G with u belongs to C1 and v
Platform: |
Size: 10240 |
Author: 卢竹江 |
Hits:
Description: The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the usual DFS (Depth First Search) and BFS( Breadth First Search) exploration algorithms perform a blind search of the graph. Ideally, the ranking function, c(x), ranks nodes based on the cost of a minimal solution reachable from node x. The problem with this ranking function is that the minimal solution must be known ahead of time. Instead, the ranking function uses an estimate, g(x), of the cost of a minimal solution reachable from node x. Using g(x) to rank nodes may require exploring unnecessary nodes in the graph?particularly if g(x) is not a good estimate.The final element of the ranking function measures the cost of reaching a node from the root. As the searches gets farther from the root node, the node falls in the ranking.
Platform: |
Size: 8192 |
Author: sathiyaraj124 |
Hits:
Description: 本代码实现用ＩＣＭＰ传递消息，检测网络通不通、主机是否可达、路由是否可用等网络本身-The pass code to use ICMP messages to detect network through the barrier, the host is reachable, routing and other network itself is available
Platform: |
Size: 47104 |
Author: yefeng |
Hits:
Description: 在MFC中实现ping命令的功能，检测远程主机是否可达，另外还具有ID地址与MAC地址的转换。-Ping command in MFC to achieve the function, remote host is reachable, also has an ID address and MAC address translation.
Platform: |
Size: 1950720 |
Author: junny |
Hits:
Description: GPRS must:
(1) enable access to company LAN and the Internet (U),
(2) provide reasonably high data rates (U),
(3) enable the subscriber to be reachable at all times – not only for telephone calls but
also for information such as new emails or latest news (U),
(4) offer flexible access, either for many subscribers at low data rates or few subscribers
at high data rates in order to optimize network usage (NP),
(5) offer low cost access to new services (U + NP).
Platform: |
Size: 136192 |
Author: feit |
Hits:
Description: Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2-Theory:
NDFA: It is a mathematical model containing 5 tuples
a) Q- finite non empty set elements of which are called as state.
b) T- set of alphabets.
c) δ- is a mapping function Q*{T {λ}}*2Q
d) S-start state i.e. S ε Q
e) F- F (subset) Q and F is a final state.
DFA: A finite automata is called DFA if
a) There is no transition for function λ.
b) For each state S and a input symbol ‘a’, there is at most one edge with a symbol ‘a’ leaving from S.
Algorithm:
1. Convert the given NDFA into state transition table where each state corresponds to a row and each input symbol corresponds to a column.
2. Construct the successor table(ST) which lists subset of state reachable from set of initial state
3. The transition graph given by the ST in the required DFA if possible reduces the number of state.
Eg:
NFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
DFA:
δ a b
qo q1 q2
q1 - q0
q2 [q0q1] -
[q0q1] q1 [q2q0]
[q2q0] [q0q1] q2
Platform: |
Size: 1024 |
Author: Merwyn |
Hits:
Description: 用邻接矩阵表示的图的类型 DFS：深度优先遍历的递归算法BFS：广度优先遍历判断从顶点vi到顶点vj是否可达-Adjacency matrix type DFS: depth-first traversal of the recursive algorithm BFS: breadth-first traversal of the judgment from the vertex vi to vertex vj is reachable
Platform: |
Size: 2048 |
Author: 赫想 |
Hits:
Description: ICMP是（Internet Control Message Protocol）Internet控制报文协议。它是TCP/IP协议族的一个子协议，用于在IP主机、路由器之间传递控制消息。控制消息是指网络通不通、主机是否可达、路由是否可用等网络本身的消息。这些控制消息虽然并不传输用户数据，但是对于用户数据的传递起着重要的作用。
安装及使用须知
1、如果用户安装的是Microsoft Visual Studio .NET 2005，那么可以直接打开Code文件夹下的项目，查看代码并进行调试。
2、由于连接远程IP地址时会被防火墙拦截，建议关闭杀毒软件与防火墙并使用本地Ip地址测试。
以上软件是需要注册才能长期正常使用的软件，请大家支持正版软件的使用。-ICMP is (Internet Control Message Protocol) Internet Control Message Protocol. It is the TCP/IP protocol suite, a sub-protocol for IP hosts, control messages are transmitted between the routers. Control message refers to the network through the barrier, the host is reachable, routing and other network itself is available messages. These control messages while not transmit user data, but the data transfer for the user plays an important role. Installation and Use 1, if the user installs the Microsoft Visual Studio. NET 2005, you can directly open the Code folder under the project, look at the code and debug. 2, due to connect to a remote IP address will be blocked by the firewall, the proposed closure of anti-virus software and firewall and use local Ip address test. These software are required to register to the long-term normal use of the software, please support genuine software.
Platform: |
Size: 47104 |
Author: 白 |
Hits:
Description: Open_vSwitch − Open_vSwitch schema
Adatabase with this schema holds the confi guration for one Open vSwitch daemon. The top-levelconfi gu-
ration for the daemon is the Open_vSwitch table, which must have exactly one record. Records in other
tables are signifi cant only when theycan be reached directly or indirectly the Open_vSwitch table.
Records that are not reachable the Open_vSwitch table are automatically deleted the ,
except for records in a fewdistinguished ‘‘root set’’tables.-Open_vSwitch − Open_vSwitch schema
Adatabase with this schema holds the confi guration for one Open vSwitch daemon. The top-levelconfi gu-
ration for the daemon is the Open_vSwitch table, which must have exactly one record. Records in other
tables are signifi cant only when theycan be reached directly or indirectly the Open_vSwitch table.
Records that are not reachable the Open_vSwitch table are automatically deleted the ,
except for records in a fewdistinguished ‘‘root set’’tables.
Platform: |
Size: 154624 |
Author: jzlzk |
Hits:
Description: Bearers must have same priority and same set of reachable destinations to be paired.
Platform: |
Size: 10240 |
Author: qppgch |
Hits:
Description: Not reachable with proper args checking.
Platform: |
Size: 1024 |
Author: fkxerzu |
Hits:
Description: minix下ping命令的实现，编译后生成的可执行文件可用于判断服务器是否可达-Under minix achieve ping command, the compiled executable file may be used to determine whether the server is reachable
Platform: |
Size: 24576 |
Author: Pu Yongming |
Hits:
Description: 3-PSS并联机器人可达工作空间绘制的MATLAB程序-3PSS parallel robot reachable workspace draw
Platform: |
Size: 6144 |
Author: 马扩 |
Hits: