E-en220资料,原理及电路设计,非常实用
上传时间: 2017-08-17
上传用户:gmh1314
赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图,v是G的一个顶点, v的偏心距定义为: Max {w∈ V,从w到v的最短路径长度} G中偏心距最小的顶点称为G的中心。试利用Floyd 算法设计一个求赋权有向图中心的算法。
标签:
上传时间: 2017-08-17
上传用户:klin3139
E-ten Glofiish X500+ Camera driver and application all comment and documentation info on chines
标签: documentation application and Glofiish
上传时间: 2013-12-09
上传用户:tyler
10 C++ Books: *C++ Timesaving Techniques For Dummies (2005) *C-C++ Programmer s Reference, 3rd Edition (2003) *Creating Games In C++ - A Step By Step Guide (2006) *Cryptography In C And C++ (2001) *Effective C++, 3rd Edition (2005) *Exceptional C++ - 47 Engineering Puzzles, *Programming Problems, And Solutions (1999) *Exceptional C++ Style - 40 New Engineering Puzzles, Programming Problems, And Solutions (2004) *How Not To Program In C++ (2003) *Ivor Horton s Beginning Visual C++ 2005 (2006) *Learn To Program With C++ (2003)
标签: Timesaving Techniques Programmer Reference
上传时间: 2014-10-15
上传用户:kikye
Useful e-book about PCI system architecture
标签: architecture Useful e-book system
上传时间: 2014-06-04
上传用户:520
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the shortest path from s to every other vertex
标签: nonnegative weight source vertex
上传时间: 2014-01-10
上传用户:xuan‘nian
Principles of Communication 5Ed R. E. Ziemer, William H. Tranter Solutions Manual
标签: E. H. R. Communication
上传时间: 2014-01-04
上传用户:guanliya
JAVA E拍网上购物业务管理 使用CRM业务流程
上传时间: 2017-08-21
上传用户:hoperingcong
an e-book of java学习JAVA的好图书
上传时间: 2013-12-25
上传用户:yuanyuan123
I have a uploaded best collection of c++ books. Please look in to these books for good understanding of c++
标签: books understanding collection uploaded
上传时间: 2014-01-25
上传用户:13681659100