网络优化习题.docVIP

1. Translate the following words into English. (1) 二分图； （2）网络； （3）连通分支； （4）支撑树； （5）割集； （6）完全图； （7）简单图； （8）关联矩阵； （9）有向图； （10）顶点； （11）全单模阵 2. Find a minimum weight spanning tree in the network below using: Kruskal’s algorithm Prim’s algorithm Prim’s algorithm (matrix method) 3. Is the following matrix a totally unimodular matrix? Why? 4. If e={i, j } is an edge of the weighted graph G=(V, E), where with weight function w, the n*n matrix is called the weight matrix of G. Suppose the weight matrix of a graph is as follows: Obtain an approximate optimal Hamiltonian cycle using the closest insertion method (Method 2), Method 3 and the MST-DFS (depth-first search) method (Method 4). 5. In the graph below, we take a spanning tree . (1) Let . What is the fundamental cycle with respect to ? (2) Let . What is the fundamental cutset with respect to ?