|  | AuD
    Lecture 'Algorithmen und Datenstrukturen' (code examples) | 
| Public Member Functions | |
| boolean | is_free () | 
| Can we enter this cell?  More... | |
| boolean | is_tunnel () | 
| letters a-z denote entries to tunnels: e.g., all 'a' are connected  More... | |
| Public Attributes | |
| char | value = '\000' | 
| the value that is displayed  More... | |
| int | color = Terminal.WHITE | 
| indexed color, see TerminalMore... | |
| double | d = Double.POSITIVE_INFINITY | 
| distance to source  More... | |
| double | f = Double.POSITIVE_INFINITY | 
| priority used by A* (distance + estimated distance to destination  More... | |
| int | p = -1 | 
| index of parent cell  More... | |
Cells have a char value that is displayed. In addition, cells with the following values can be accessed: white space, letters, and digits. Any other values will be interpreted as "obstacles".
The color attribute can be used for visualization and as a flag (e.g., cell was processed). Note: Whether color can be displayed depends on Terminal.
The remaining attributes are used during traversal (see lecture).
| boolean aud.example.grid.Grid.Cell.is_free | ( | ) | 
Can we enter this cell?
Definition at line 75 of file Grid.java.
References aud.example.grid.Grid.Cell.value.
| boolean aud.example.grid.Grid.Cell.is_tunnel | ( | ) | 
letters a-z denote entries to tunnels: e.g., all 'a' are connected
Definition at line 81 of file Grid.java.
References aud.example.grid.Grid.Cell.value.
Referenced by aud.example.grid.Grid.create_tunnels_for().
 Here is the caller graph for this function:
 Here is the caller graph for this function:| int aud.example.grid.Grid.Cell.color = Terminal.WHITE | 
| double aud.example.grid.Grid.Cell.d = Double.POSITIVE_INFINITY | 
| double aud.example.grid.Grid.Cell.f = Double.POSITIVE_INFINITY | 
| char aud.example.grid.Grid.Cell.value = '\000' | 
the value that is displayed
Definition at line 73 of file Grid.java.
Referenced by aud.example.grid.Grid.Cell.is_free(), and aud.example.grid.Grid.Cell.is_tunnel().