学堂在线清华大学数据结构(上)(2021春)课后作业题答案
- Starting from s, perform DFS on the above undigraph, order a~z between 2021-06-20
- Starting from s, perform BFS on the above undigraph, order a~z betwee 2021-06-20
- The following is the dTime and fTime of each vertex after performing a 2021-06-20
- G is a directed acyclic graph, and (u, v) is an edge in G that point 2021-06-20
- Time complexity of accessing data stored in vertex v: 访问顶点v中存储 2021-06-20
- Time complexity of traversing all the neighbors of vertex v: 遍历顶点v 2021-06-20
- Time complexity of deleting edge(i,j): 删除边(i, j)的时间复杂度: AO(1) 2021-06-20
- Using the adjacency matrix to implement a graph with n vertices and e 2021-06-20
- G is a simple undigraph, A is an adjacency matrix of G, M is an associ 2021-06-20
- For a simple undigraph with n vertices and e edges, which of the follo 2021-06-20
- The adjacency matrix of the above digraph is (in order of A, B, C, D) 2021-06-20
- In the long history of humanity, everyone may have to shake hands with 2021-06-20
- A total of 7 people took part in the banquet and a friendly handshake 2021-06-20
- In a simple undigraph with 20 vertices, the maximum number of edges is 2021-06-20
- DFS on a graph, which situation means that the graph contains a loop 2021-06-20
- Run breadth-first search (BFS) and depth-first search (DFS) respective 2021-06-20
- u and v are two vertices in the graph. After performing DFS on the gra 2021-06-20
- DFS on the above undigraph with A as the starting point, and the neigh 2021-06-20
- For graphs with n vertices and e edges implemented with adjacency list 2021-06-20
- The BFS is performed on the above undigraph with the vertex s as the s 2021-06-20
- The breadth-first search of a graph is similar to that of a binary tre 2021-06-20
- Traversing graphs in a sense is to translate the graph into: 对图进行 2021-06-20
- The graph G contains n vertices (n>0), implemented with an adjacency m 2021-06-20
- In the graph implemented with adjacency matrices with n vertices, the 2021-06-20
- The adjacency matrix of the above digraph is (in order of A, B, C, D) 2021-06-20