搜索结果
找到约 2,214 项符合
top-e 的查询结果
VC书籍 e-book to learn vc++ mfc
e-book to learn vc++ mfc
VC书籍 e-book to learn vc++ mfc
e-book to learn vc++ mfc
文章/文档 Pro E part about a mechanical piece on done in PRO Engineering sotware
Pro E part about a mechanical piece on done in PRO Engineering sotware
数据结构 赋权有向图中心问题 问题描述: 设G=(V,E)是一个赋权有向图
赋权有向图中心问题
问题描述:
设G=(V,E)是一个赋权有向图，v是G的一个顶点，
v的偏心距定义为：
Max {w∈ V,从w到v的最短路径长度}
G中偏心距最小的顶点称为G的中心。试利用Floyd
算法设计一个求赋权有向图中心的算法。 ...
驱动编程 E-ten Glofiish X500+ Camera driver and application all comment and documentation info on chines
E-ten Glofiish X500+ Camera driver and application all comment and documentation info on chines
其他书籍 Useful e-book about PCI system architecture
Useful e-book about PCI system architecture
数值算法/人工智能 The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of cla
The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of poss ...
数学计算 Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in
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
其他书籍 Principles of Communication 5Ed R. E. Ziemer, William H. Tranter Solutions Manual
Principles of Communication 5Ed R. E. Ziemer, William H. Tranter Solutions Manual