Data Structures, Algorithms and Applications in C++, 2nd ed.
: Chapter 16 Graphs
terminology:
vertex, edge, adjacent, incident, degree, cycle, path, connected component, and spanning tree
types:
undirected / directed / weighted
representation:
adjacent matrix / array adjacency lists / linked adjacency lists
standard graph search methods:
breadth-first / depth-first search
algorithms:
graph
: an ordered pair of finite sets of vertices (or nodes or points) and edges (or arcs or lines)
http://en.wikipedia.org/wiki/Graph_(data_structure)
loop
: self-edge
digraph
: directed graph
network
: weighted undirected graph or digraph
example 16.1: path problems
example 16.2: spanning trees
A graph is connected iff there is a path between every pair of vertices in the graph.
cycle
: simiple path with the same start and end vertex
tree
: a connected undirected graph that contains no cycles
spanning tree
: a subgraph of a graph that contains all the vertices of the graph and is a tree
example 16.3: interpreters
bipartite graphs
ADT graph = Abstract Data type graph
http://en.wikipedia.org/wiki/Abstract_data_type
http://en.wikipedia.org/wiki/Pure_virtual_method
linked adjacency list
array adjacency list
http://en.wikipedia.org/wiki/Adjacency_matrix
http://en.wikipedia.org/wiki/Adjacency_list
cost-adjacency-matrix
cp. level-order traversal of a binary tree
http://en.wikipedia.org/wiki/Binary_search_tree#Traversal
cp. pre-order traversal of a binary tree
'@GSMC > 서용덕: Multimedia Programming C++' 카테고리의 다른 글
merge sort (0) | 2009.06.01 |
---|---|
Hill & Kelly [Computer Graphics Using OpenGL] (0) | 2009.04.18 |
Sahni Chapter 8. Stacks (0) | 2009.04.11 |
Sartaj Sahni <Data Structures, Algorithms, and Applications in C++> 2nd ed. (0) | 2009.03.09 |
Deitel <C++ How to program> Sixth ed. (0) | 2009.03.07 |