Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Everyday data structures

You're reading from   Everyday data structures A practical guide to learning data structures simply and easily

Arrow left icon
Product type Paperback
Published in Mar 2017
Publisher Packt
ISBN-13 9781787121041
Length 344 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
 Smith Smith
Author Profile Icon Smith
Smith
Arrow right icon
View More author details
Toc

Table of Contents (20) Chapters Close

Everyday Data Structures
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface
1. Data Types: Foundational Structures FREE CHAPTER 2. Arrays: Foundational Collections 3. Lists: Linear Collections 4. Stacks: LIFO Collections 5. Queues: FIFO Collections 6. Dictionaries: Keyed Collections 7. Sets: No Duplicates 8. Structs: Complex Types 9. Trees: Non-Linear Structures 10. Heaps: Ordered Trees 11. Graphs: Values with Relationships 12. Sorting: Bringing Order Out Of Chaos 13. Searching: Finding What You Need

Visual graph concepts


It is sometimes easier to grasp the concept of graph data structures using visual representations of some collections. Consider the following diagram:

This is a basic graph consisting of eleven nodes and twelve edges. Sets N and E can be described as follows:

N = {2, 3, 4, 5, 9, 11, 19, 38, 52, 77, 97}

E = {2:38, 2:77, 2:97, 3:19, 4:77, 5:2, 5:19, 11:2, 11:4, 11:5, 11:52, 77:9}

Note that, in this example, there are only unidirectional edges between nodes. This is perfectly acceptable, but graphs are much more powerful when bidirectional nodes are permitted. Consider the following example:

This is the same graph we saw earlier, but set E now contains several new reciprocal edges between existing nodes. Sets N and E can now be described as follows:

N = {2, 3, 4, 5, 9, 11, 19, 38, 52, 77, 97}

E = {2:5, 2:38, 2:77, 2:97, 3:19, 4:11, 4:77, 5:2, 5:19, 11:2, 11:4, 11:5, 11:52, 77:9, 97:2}

Finally, edges between nodes can also be defined with a particular value. Consider the following...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime
Visually different images