AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.example.graph.RetroMaze Class Reference

a really simple game, which lets you explore a maze... pardon: a graph More...

+ Collaboration diagram for aud.example.graph.RetroMaze:

Public Member Functions

 RetroMaze (MyGraph g, MyNode entry, MyNode exit)
 

Static Public Member Functions

static void main (String[] args)
 

Detailed Description

a really simple game, which lets you explore a maze... pardon: a graph

Definition at line 10 of file RetroMaze.java.

Constructor & Destructor Documentation

◆ RetroMaze()

Definition at line 19 of file RetroMaze.java.

19 {
20 g_=g;
21 entry_=room_=entry;
22 exit_=exit;
23 }

Member Function Documentation

◆ main()

static void aud.example.graph.RetroMaze.main ( String[]  args)
static

Definition at line 89 of file RetroMaze.java.

89 {
90 MyGraph g=new MyGraph(false); // easy mode: undirected graph
91
92 if (args.length==0)
93 g=new GraphP88();
94 else {
95 new GraphParser(g.getAbstractGraph()).parse(new File(args[0]));
96 }
97
98 MyNode entry=pickNode(g), exit=null;
99 while ((exit=pickNode(g))==entry) {}
100
101 RetroMaze maze=new RetroMaze(g,entry,exit);
102
103 maze.start();
104 }
RetroMaze(MyGraph g, MyNode entry, MyNode exit)
Definition: RetroMaze.java:19

References aud.example.graph.MyGraph.getAbstractGraph(), and aud.example.graph.GraphParser.parse().

+ Here is the call graph for this function:

The documentation for this class was generated from the following file: