20162314 《Program Design & Data Structures》Learning Summary Of The Tenth Week

20162314 2017-2018-1 《Program Design & Data Structures》Learning Summary Of The Tenth Week

Summary of Key Concepts

• An undirected graph is a graph where the pairings representing the edges are unordered.

• Two vertices in a graph are adjacent if there is an edge connecting them.

• An undirected graph is considered complete if it has the maximum number of edges connecting vertices.

• A path is a sequence of edges that connects two vertices in a graph.

• A cycle is a path in which the first and last vertices are the same and none of the edges are repeated.

• In a directed graph, the edges are ordered pairs of vertices.

• A path in a directed graph is a sequence of directed edges that connects two vertices in a graph.

• A weighted graph is a graph with costs associated with each edge.

• The main difference between a depth-first traversal of a graph and a breadth-first traversal is the use of a stack instead of a queue to manage the traversal.

• A graph is connected if and only if the number of vertices in the breadth-first traversal is the same as the number of vertices in the graph regardless of the starting vertex.

• A spanning tree is a tree that includes all of the vertices of a graph and some, but possibly not all, of the edges.

• A minimum spanning tree is a spanning tree where the sum of the weights of the edges is less than or equal to the sum of the weights for any other spanning tree for the same graph.

Problem and solution in teaching materials.

What does it mean to say that a graph is complete?

• A graph is considered complete if it has the maximum number of edges connecting vertices.

What is the maximum number of edges for an undirected graph? A directed graph?

• The maximum number of edges for an undirected graph is n(n–1)/2. For a directed graph, it is n(n–1).

What is the definition of a path? A cycle?

• A path is a sequence of edges that connects two vertices in a graph. A cycle is a path in which the first and last vertices are
• the same and none of the edges are repeated.

What is the difference between a weighted graph and a graph?

• A weighted graph is a graph, either directed or undirected, with weights or costs associated with each edge.

What is a spanning tree? A minimum spanning tree?

• A spanning tree is a tree that includes all of the vertices of a graph and some, but possibly not all, of the edges. A minimum
• spanning tree is a spanning tree where the sum of the weights of the edges is less than or equal to the sum of the weights for any
• other spanning tree for the same graph.

Code hosting

What is the maximum number of edges for an undirected graph? A directed graph?

• The maximum element is removed from a heap (maxheap) by replacing the root with the last leaf of the tree, then moving that
• element down the tree as appropriate to reassert the proper relationships among the elements.

Summary of error for last week.

Linear search is always more effective than binary search.The answer should be false, for the situation of "n = 2".

Evaluate for my partner

• Advantage and problem in the blog：
  • Concise and comprehensie
  • Uncleary to the content
  • Mould is amazing
• Advantage and problem in the code：
  • Serious writing.
  • Wonderful idea
  • Too less

Learning situation of partner

• 20162310

• Learning content of partner：
  • Algorithm
  • Recursion
  • HanoiTowers and maze

Anything else that want to say

• It's not easy to persere on utizing English to write a blog.But I'm getting used to doing this because of the benefit.

Academic progress check

	Code line number（increasing/accumulative）	Blog number（inc/acc）	studying time（inc/acc）	progress
target	5000lines	30articles	400hours
First week	180/180	1/1	20/20
Second week	1049/1229	1/2	18/38
Third week	1037/2266	3/7	22/60
Fourth week	1120/3386	2/9	30/90