Getting There From Here

If you're having trouble following that, here's the gist of what is happening: We have a "queue" of nodes that starts with just our marked starting node in it. Then, we run a piece of code that loops, pulling a node from the queue every time until it is empty. In this loop's...

Full description

Saved in:
Bibliographic Details
Published in:Game Developer 2011-10, p.13
Main Author: Johnston, Chevy Ray
Format: Article
Language:English
Subjects:
Algorithms
Coffee
Coffeehouses
Computer & video games
Games
Logic
Motion control
Product design
User interface
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:If you're having trouble following that, here's the gist of what is happening: We have a "queue" of nodes that starts with just our marked starting node in it. Then, we run a piece of code that loops, pulling a node from the queue every time until it is empty. In this loop's code, we take the node that was pulled and look at each of its "neighbors," or adjacent nodes.
ISSN:1073-922X