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

Chapter 11. Graphs: Values with Relationships

The final data structure that we will examine is the Graph. Graphs are sets of objects with no specifically structured relationship, where each object can have links to one or many other objects in the collection. Objects in graphs are typically referred to as nodes, vertices, or points. Links, or the relationships between the objects, are referred to as edges, lines, or arcs. These links can be simple references or they can be objects with values of their own. More formally stated, graphs are a pair of sets (N, E), where N is the set of nodes and E is the set of edges in the collection.

One excellent example of graph applications would be visualizing the relationships between individuals in a social media database. In such a database, each person in the database represents one node, and each of their links to other people in their circle of acquaintances represents an edge. In such a circle of acquaintances, it would be perfectly reasonable to...

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