Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
Data Organization   ◾     209  
by a set of features that describe the overall structure of the graph itself.
For our text, the features of most concern are listed next and illustrated by
reference to graph G of Figure7.13.
Adjacency—Assume that U and V are vertices in some graph. Vertex U
is adjacent to vertex V if there is an arc (U, V) in the graph. For exam-
ple, vertex D is adjacent to vertex C in G since the arc (D, C) appears in
G. Vertex C is not adjacent to D since the arc (C, D) is not in G.
Loop—A loop is any arc such that the rst and second nodes of the
arc are the same. Graph G does not have a loop.
In-degree—e in-degree ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793