블로그 이미지
Leeway is... the freedom that someone has to take the action they want to or to change their plans.
maetel

Notice

Recent Post

Recent Comment

Recent Trackback

Archive

calendar

1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30
  • total
  • today
  • yesterday

Category

'@GSMC/서용덕: Multimedia Programming C++'에 해당되는 글 6건

  1. 2009.06.11 Sahni's ch.16 Graphs
  2. 2009.06.01 merge sort
  3. 2009.04.18 Hill & Kelly [Computer Graphics Using OpenGL]
  4. 2009.04.11 Sahni Chapter 8. Stacks
  5. 2009.03.09 Sartaj Sahni <Data Structures, Algorithms, and Applications in C++> 2nd ed.
  6. 2009.03.07 Deitel <C++ How to program> Sixth ed.
Sahni
Data Structures, Algorithms and Applications in C++, 2nd ed.
: Chapter 16 Graphs

graph data structure

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:



16.1 Definitions

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


16.2 Applications and More Definitions

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


16.3 Properties

http://en.wikipedia.org/wiki/List_of_graph_theory_topics

in-degree
out-degree

complete digraph


16.4 The ADT graph
16.5 Representation of Unweighted Graphs

adjacency matrix
linked adjacency list
array adjacency list

http://en.wikipedia.org/wiki/Adjacency_matrix

http://en.wikipedia.org/wiki/Adjacency_list
16.6 Representation of Weighted Graphs


cost-adjacency-matrix


16.7 Class Implementations

 
16.8 Graph Search Methods

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
 
 


 
posted by maetel
2009. 6. 1. 01:51

보호되어 있는 글입니다.
내용을 보시려면 비밀번호를 입력하세요.

By F. S. Hill, Jr., Francis S. Hill, Stephen M. Kelley, Stephen M. Kelley, Jr.
Edition: 3, illustrated, revised
Published by Prentice Hall, 2006
ISBN 0131496700, 9780131496705
posted by maetel

Sartaj Sahni
Data Structures, Algorithms, and Applications in C++

Chapter 8 Stacks



http://cplusplus.com/reference/stl/stack/

http://en.wikipedia.org/wiki/Stack_(data_structure)

http://www.sgi.com/tech/stl/stack.html

http://www.cppreference.com/wiki/stl/stack/start


stack = a linear list with a last-in-first-out (LIFO) structure

recursion stack

return address = location of the program instruction to execute once the invoked method completes


http://en.wikipedia.org/wiki/Abstract_data_type
An abstract data type (ADT) is a specification of a set of data and the set of operations that can be performed on the data. Such a data type is abstract in the sense that it is independent of various concrete implementations.

In software engineering, an abstract type is a type in a nominative type system which is declared by the programmer, and which has the property that it contains members which are also members of some declared subtype. In many object oriented programming languages, abstract types are known as abstract base classes, interfaces, traits, mixins, flavors, or roles.


http://cplusplus.com/reference/std/exception/exception/




posted by maetel

Data Structures, Algorithms, and Applications in C++

By Sartaj Sahni

Edition: 2, illustrated
Published by Silicon Press, 2005
ISBN 0929306325, 9780929306322
792 pages

1st ed. : http://www.mhhe.com/engcs/compsci/sahni/
2nd ed.: http://www.cise.ufl.edu/~sahni/dsaac/

COP 3530 : Data Structures and Algorithms
Department of Computer and Information Sciences and Engineering, University of Florida



'@GSMC > 서용덕: Multimedia Programming C++' 카테고리의 다른 글

Sahni's ch.16 Graphs  (0) 2009.06.11
merge sort  (0) 2009.06.01
Hill & Kelly [Computer Graphics Using OpenGL]  (0) 2009.04.18
Sahni Chapter 8. Stacks  (0) 2009.04.11
Deitel <C++ How to program> Sixth ed.  (0) 2009.03.07
posted by maetel

http://int.prenhall.com/deitel/

C++ How to Program, 6/e  
 Harvey M. Deitel and Paul J. Deitel, both from Deitel & Associates, Inc.
© 2008, 1500 pp., paper (0-13-615250-3)
 
C++ How to Program, 6e  Example Downloads 
 
C++ Programming Resource Center

Deitel Free Content Library#CPLUSPLUS

C++ Programming Curriculum Overview

posted by maetel