Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Getting Started with Python

You're reading from   Getting Started with Python Understand key data structures and use Python in object-oriented programming

Arrow left icon
Product type Course
Published in Feb 2019
Publisher Packt
ISBN-13 9781838551919
Length 722 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (3):
Arrow left icon
Benjamin Baka Benjamin Baka
Author Profile Icon Benjamin Baka
Benjamin Baka
Fabrizio Romano Fabrizio Romano
Author Profile Icon Fabrizio Romano
Fabrizio Romano
Dusty Phillips Dusty Phillips
Author Profile Icon Dusty Phillips
Dusty Phillips
Arrow right icon
View More author details
Toc

Table of Contents (31) Chapters Close

Title Page
Copyright and Credits
About Packt
Contributors
Preface
1. A Gentle Introduction to Python FREE CHAPTER 2. Built-in Data Types 3. Iterating and Making Decisions 4. Functions, the Building Blocks of Code 5. Files and Data Persistence 6. Principles of Algorithm Design 7. Lists and Pointer Structures 8. Stacks and Queues 9. Trees 10. Hashing and Symbol Tables 11. Graphs and Other Algorithms 12. Searching 13. Sorting 14. Selection Algorithms 15. Object-Oriented Design 16. Objects in Python 17. When Objects Are Alike 18. Expecting the Unexpected 19. When to Use Object-Oriented Programming 20. Python Object-Oriented Shortcuts 21. The Iterator Pattern 22. Python Design Patterns I 23. Python Design Patterns II 24. Testing Object-Oriented Programs 1. Other Books You May Enjoy Index

Graphs


A graph is a set of vertices and edges that form connections between the vertices. In a more formal approach, a graph G is an ordered pair of a set V of vertices and a set E of edges given as G = (V, E) in formal mathematical notation.

An example of a graph is given here:

Let's now go through some definitions of a graph:

  • Node or vertex: A point, usually represented by a dot in a graph. The vertices or nodes are A, B, C, D, and E.
  • Edge: This is a connection between two vertices. The line connecting A and B is an example of an edge.
  • Loop: When an edge from a node is incident on itself, that edge forms a loop.
  • Degree of a vertex: This is the number of vertices that are incident on a given vertex. The degree of vertex B is 4.
  • Adjacency: This refers to the connection(s) between a node and its neighbor. The node C is adjacent to node A because there is an edge between them.
  • Path: A sequence of vertices where each adjacent pair is connected by an edge.
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 $19.99/month. Cancel anytime
Banner background image