0% found this document useful (0 votes)
31 views

Fall in Love Grow Old Turn Into Frog Acquire Super Human Strength Regain Youth Perform Well in Exams

This document describes a path finding game where a player must navigate between 6 nodes on a graph to collect spells from each node and reach the destination node 5. The graph contains the nodes and weighted edges connecting them. Each node contains a spell object in a linked list that the player collects and adds to their own linked list as they visit the nodes. When the player reaches node 5, they display all the spells they acquired. The task is to implement this game in C++.

Uploaded by

bob
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
31 views

Fall in Love Grow Old Turn Into Frog Acquire Super Human Strength Regain Youth Perform Well in Exams

This document describes a path finding game where a player must navigate between 6 nodes on a graph to collect spells from each node and reach the destination node 5. The graph contains the nodes and weighted edges connecting them. Each node contains a spell object in a linked list that the player collects and adds to their own linked list as they visit the nodes. When the player reaches node 5, they display all the spells they acquired. The task is to implement this game in C++.

Uploaded by

bob
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CW 2

Introduction
This assignment requires you to implement a path finding game. A player will
navigate over a Graph containing 6 Nodes, taking the quickest route from
Node 0 to Node 5. Each Node contains a LinkedList containing a single Spell
object. As the player visits the Nodes he will pick up the Spells and store
them within his own LinkedList of Spell objects. When the Player reaches
the destination (Node 5) he displays the spells he has acquired within the
console.

The Graph
The diagram below shows the Nodes. Edges and weights for the game.
2

1
4
4

The Spells
Node
0
1
2
3
4
5

Spell
Fall in love
Grow old
Turn into frog
Acquire super human strength
Regain youth
Perform well in exams

Task
Implement the system as described above in C++.

You might also like