tailieunhanh - Lecture Algorithm design - Chapter 3: Graphs
The following will be discussed in this chapter: Basic definitions and applications, graph connectivity and graph traversal, testing bipartiteness, connectivity in directed graphs, DAGs and topological ordering. | 3. Graphs basic definitions and applications graph connectivity and graph traversal testing bipartiteness connectivity in directed graphs DAGs and topological ordering Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne http wayne kleinberg-tardos Last updated on Sep 8 2013 6 19 AM Section 3. Graphs basic definitions and applications Undirected graphs Notation. G V E V nodes. E edges between pairs of nodes. Captures pairwise relationship between objects. Graph size parameters n I V I m I E I. V 1 2 3 4 5 6 7 8 E 1-2 1-3 2-3 2-4 2-5 3-5 3-7 3-8 4-5 5-6 7-8 m 11 n 8
đang nạp các trang xem trước