这是学习民事诉讼法入门的一章，重点掌握三个问题： 一、是弄清什么是民事诉讼； 二、是正确理解民事诉讼法及其性质、任务和效力； 三、是民事诉讼的要求

重阳思想： 《周易·彖辞》——大哉乾元，万物资始，乃统天。至哉坤元，万物资生，乃顺承天。 《周易·象辞》——天行健，君子以自强不息

Definition. A flow network is a directed graph G = (V, E) with two distinguished vertices: a source s and a sink t. Each edge (u, v) ∈ E has a nonnegative capacity c(u, v). If (u, v) ∉ E, then c(u, v) = 0

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

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:

Definition. A directed graph (digraph) G = (V, E) is an ordered pair consisting of • a set V of vertices (singular: vertex)

How large should a hash table be? Problem: What if we don’t know the proper size in advance? Goal: Make the table as small as possible, but large enough so that it won’t overflow (or otherwise become inefficient)

Computational geometry Algorithms for solving “geometric problems” in 2D and higher. Fundamental objects: point line segment line Basic structures: point set polygon

Balanced search tree: A search-tree data structure for which a height of O(lg n) is guaranteed when implementing a dynamic set of n items

Algorithms Day 12 L8.2 A weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket. IDEA: Choose the hash function at random, independently of the keys