Lecture Notes and homework for class 1111-1114 Of The Family Planning Division (deadline:, January 1, April 3, 2014-the evening of Thursday, students notified by the aption Committee)

In Week 4, we will focus on "Chapter 3rd: Graph Decomposition ". The graph theory starts with the 7-Bridge Model of colenburg in Euler's, and then introduces the application of the graph model in some other fields.

Lecture content

1.The origin of Graph Theory: Euler's 7-Bridge Model of gonisburg, Euler's loop, and Euler's path. Extended is the Hamilton loop and Hamilton pathway. When you study, you can summarize and compare these concepts by yourself. In combination with Discrete Mathematics and data structure, you can first clarify the definitions of these concepts and then compare the differences, finally, a Graph (G) can be programmed to calculate the path of Euler's loop.

2.Graph Application: Map coloring, matching (Extended reading: century jiayuan's entrepreneurial experience), data visualization, etc.

3. Graph Representation: There are two main methods: the adjacent matrix and the adjacent table. Understand the advantages and disadvantages of the two representations.

4. (important)Deep Priority Search for undirected graphs(DFS): Given the graph G (V, E) and a node v, you can get the corresponding DFS tree. You can master the tree edge and the back edge; use the DFS algorithm to calculate the number of connected components of a graph (what is the idea ?); When traversing a node, count the forward and backward Order (simple ideas give us a lot of inspiration ).

5. (important)YesDeep Search for Directed Graphs(DFS): grasp the traversal Representation Method of the right graph 3-7 of P102; master the Judgment Method of the tree edge, forward edge, return side, and cross side in the edge (u, v, then, determine whether the graph has a loop. If there is no loop (directed acyclic graph), calculate the linearity of its nodes (I .e., topological sorting ).

6. (additional knowledge)Search engine and PageRank algorithm. For a limited amount of time in the class, the teacher can only "know" The content. You can take the initiative to collect more information and the materials distributed by the teacher to learn more.

Download and link

1. Graph Decomposition and PageRank algorithm (I): mainly introduces graph decomposition.

2. Graph Decomposition and PageRank algorithm (II): mainly introduces graph application and PageRank algorithm

3. PageRank algorithm: Principle, others.

4. Open Course on Algorithms and excellent books: Algorithms, 4th Edition (download), and introduction to Algorithms

Job Requirements1. Ask the students from the school committees to complete their homework.
2. Homework is counted into the average score. The score is based on the degree of completion-attitude (done/not done ). Teachers will select a number of students to make comments based on the quality of their assignments and provide the basis for personalized teaching. Please provide as high a level of homework as possible based on your own capabilities, and do your best to improve your own capabilities.

3. In this assignment, the instructor will spot the student IDStudents from November 30Please tell each other.

Job content

Continuous learning is required. Please complete at least the following exercise 1. Hope that students who are interested in programming can complete 1, 2, and 3. Now, every minute you pay can be more than 10 times the reward. What are the advantages of computer science students over vocational training.

1. Graph Representation: The graph data file (tinyg.txt.pdf is calculated to the adjacent matrix of the graph, and the adjacent matrix is saved to the file (tinyg_matrix.txt.Class Name:GraphRepresentation. From Algorithms, 4th Edition, P522.Blog title:Assignments for week 4-Graph Representation

2. undirected graph DFS Algorithm: Based on the predefined formula in the tutorial, The dfsalgorithm of the current graph is used to generate the graph data file (tinyg.txt), which can output the DFS node traversal results, the Pre and Post values of each node, and the number of connected components and nodes.Class Name:GraphDFS.Blog title:Week 4 job-undirected graph DFS Algorithm

3. The judgment of directed acyclic graph: according to the definition of directed acyclic graph (daggregator), programming implementation and judging whether the G has a ring, and further finding out the path of the ring (such as: v1-v5-v6-v1 ).Class Name:GraphDAG. From Algorithms, 4th Edition.Blog title:Assignments for week 4-judgment on Directed Acyclic Graphs

Preview in advance

1. Chapter 3: strongly connected components of a graph (strongly connected subgraph)

2. Chapter 4: Graph path

Recommended reading

In college, we often hear a variety of suggestions, which leads to confusion. What is the purpose of the study? Do civil servants need to rely on relationships? Can joining the party contribute to work? I usually don't look for a job in the exam scores ?...... Are these ideas true? Where is the error? We must have our own judgment. The improvement of human judgment is related to the constant enrichment of human vision and practice.

As a college student, at least one book should be read every two weeks (15 days). After 3.5 years in college and over 100 books, the breadth and depth of thinking will be improved. In this impetuous society, we need to have our own value judgments. Although it is already the last year of college, you can do many things to enrich yourself and improve your job competitiveness in one year.

In this issue, we recommend "attacking the university against the positive energy passed to IT students" and the blog of Mr. He Lijian to see the common puzzles of our peers, as well as the direction and path we have taken. Thinking before going to bed last night: It's okay. How can I find a job? Maybe God closed the door to let us see different scenery through the window. Relationship, so we can make less effort, and at the same time we can select a very narrow area (after all, the link extension is very narrow); it is because there is no relationship, we need to rely on our own strength and perseverance, so we can experience the true joy and bitterness. Young people are capital, and we are our greatest capital.

Yesterday, I chatted with several students at home and talked about the relationship. I shared my words with my freshman Brother and Sister. "I went to the hospital once and heard a nurse say, 'You see, this is the way the relationship comes in, even this kind of problem won't be solved. 'It's full of disdain and contempt. Therefore, even if we depend on the relationship, we need to improve our original strength so that we can gain a firm foothold without losing the faces of our fathers .".

Sorry, I did not release my job at last night.