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 now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Mastering LibGDX Game Development

You're reading from   Mastering LibGDX Game Development Leverage the power of LibGDX to create a fully functional, customizable RPG game for your own commercial title

Arrow left icon
Product type Paperback
Published in Nov 2015
Publisher
ISBN-13 9781785289361
Length 420 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Patrick Hoey Patrick Hoey
Author Profile Icon Patrick Hoey
Patrick Hoey
Arrow right icon
View More author details
Toc

Table of Contents (12) Chapters Close

Preface 1. As the Prophecy Foretold, a Hero is Born 2. Welcome to the Land of BludBourne FREE CHAPTER 3. It's Pretty Lonely in BludBourne… 4. Where Do I Put My Stuff? 5. Time to Breathe Some Life into This Town 6. So Many Quests, So Little Time… 7. Time to Show These Monsters Who's the Boss 8. Oh, No! Looks Like Drama! 9. Time to Set the Mood 10. Prophecy Fulfilled, Our Hero Awaits the Next Adventure Index

The theory of dependency graphs


We are going to extend what we learned with the previous chapter when constructing a conversation graph, and with a few (but significant) changes, create a quest dependency graph that will store the completion state of its corresponding tasks. A dependency graph is essentially a directed graph representing dependencies of several objects with each other. The key difference of this graph from the conversation graph is that the dependency graph does not contain any cycles. A graph with circular dependencies would lead to a situation where no valid evaluation order exists, since none of the vertices can be evaluated first. Without cycles in a graph, we will end up using a directed acyclic graph (DAG).

As explained later, we will make sure that we check for cycles every time we add a new dependency, and if any of them are found, disregard that particular dependency.

The following diagram (Figure 2) represents a sample dependency graph with four total vertices and...

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