Fall in Love Grow Old Turn Into Frog Acquire Super Human Strength Regain Youth Perform Well in Exams
Fall in Love Grow Old Turn Into Frog Acquire Super Human Strength Regain Youth Perform Well in Exams
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++.