搜索资源列表
center
- 对于给定的赋权有向图G，编程计算图的中心-For a given directed graph Empowering G, programming calculation map center
S030602102
- 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图，v是G的一个顶点， v的偏心距定义为： Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。-Empowering the central issue Digraph Problem Descr iption: Let G = (V, E
zuixiaoquandingdianfugai
- 给定一个赋权无向图G=(V,E)，每个定点v∈U都有一个权值w(v)。如果U V，且对任意(u,v)∈E有u∈U或v∈U，就称U为图G的一个定点覆盖。G的最小权顶点覆盖是指G中所含顶点权之和最小的顶点覆盖。-Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈
zuiduanlujing
- 在一个赋权有向图上寻找最短路径问题也是图应用的一个重要课题-Empowering in a directed graph to find the shortest path map application is also an important topic
ucTCP-IP_V1_92
- Micriμm Empowering Embedded Systems μC/TCP-IP V1.92 User’s Manual
97Things
- 这是一本关于Refactoring的书，从网上搜集并且整理为PDF文档，希望大家可以从这篇文章中学到更多的东西。-In this truly unique technical book, today s leading software architects present valuable principles on key development issues that go way beyond technology. More
Micrium-Atmel-uCOS-II-View-TCPIP-AT91SAM7X256
- Micriμm Empowering Embedded Systems μC/OS-II μC/TCP-IP μC/OS-View and the Atmel AT91SAM7X256
Empowering-the-RMI-in-Java-Approach
- Empowering the RMI in Java Approach
Ehlib.v5.0.02
- EhLib 5.2 contains the components and classes for Borland Delphi 5-8, 2005, 2006, C + + Builder 5-6, CodeGear Delphi 2007, CodeGear RAD Studio 2009, Embarcadero RAD Studio 2010 is aimed at empowering the client part of d
redp4549
- Empowering Security and Compliance Management for the z-OS RACF Environment using IBM Tivoli Security Management for z-OS