2.1概述 2.2中央处理器CPU 2.3存储器 2.4总线与输入/输出接口电路 2.5输入/输出设备

Shortest paths Single-source shortest paths nonnegative edge weights Dijkstra's algorithm: O(E+ vlg n General

麻省理工学院：《算法导论》（英文版） Lecture 21 Prof charles e. leiserson

Disioint-set data structure (Union-Find) Problem: maintain a dynamic collection of pairwise-disjoint sets S=(S Each set S; has one element distinguished as the representative element, rep[sil lust support 3 operations

Negative-weight cycles Recall: If a graph G=(V, E) contains a negative weight cycle then some shortest paths may not exist

Paths in graphs Consider a digraph g=(v, E)with edge-weight function w:E→>R. The weight of path p=v1→ →>…→> vi is defined to be (D)=∑(n,1)

How large should a hash table be? Goal: Make the table as small as possible but large enough so that it wont overflow(or otherwise become inefficient Problem: what if we don 't know the proper size

Fixed -universe successor problem Goal: maintain a dynamic subset s of size n of the universe 0=10, 1,.,u-1 of size u subject to these operations INSERT(X∈U\\S): Add x to s DELETE(X E S): Remove x from S

复旦大学：《网络科学导论 Introduction to Network Science》教学参考文献_Detection and prediction with time serial based on network science

复旦大学：《网络科学导论 Introduction to Network Science》教学参考文献_Community detaction-fast unfolding