6.1 引言 6.2 TCP/IP协议简介 6.3 IP v6协议 6.4 RSVP协议 6.5 ST Ⅱ协议 6.6 RTP协议

5.1 引言 5.2 基于LAN的接入 5.3 基于交互式电视网的接入 5.4 基于电话网的ADSL接入

3.1 引言 3.2 多媒体信息同步描述法 3.3 多媒体同步控制机制

2.1 引言 2.2 基本编码方法 2.3 图像编码标准 2.4 语音编码标准

Algorithms Day 40 L23.2 Recall from Lecture 22 • Flow value: | f | = f(s, V). Cut: Any partition (S, T) of V such that s ∈ S and t ∈ T

Take-home quiz No notes (except this one)

Problem: Maintain a dynamic collection of pairwise-disjoint sets= {S1, S2, .. S } Each set S; has one element distinguished as the representative element, rep[]

Shortest paths Single-source shortest paths Nonnegative edge weights

Algorithms Day 31 L18.2 Negative-weight cycles Recall: If a graph G = (V, E) contains a negative￾weight cycle, then some shortest paths may not exist. Example:

Consider a digraph G = (V, E) with edge-weight function w : E → R. The weight of path p = v1 → v2 → L → vk is defined to be