D E I J L M N O P Q S T V

D

dequeue() - Method in class Queue
 

E

enqueue(Item) - Method in class Queue
 

I

isEmpty() - Method in class Queue
 
isEnd() - Method in class Stav
Zjisti, je-li stav konecny

J

jeNavstiven(int, int, boolean) - Static method in class Stav
Zjisti, zda uz byl stav navstiven
jePripustny(int, int) - Static method in class Stav
Zjisti, je-li stav pripustny (pripustny ve smyslu pravidel daneho problemu, tj. vic misionaru nez kanibalu na brehu)

L

look() - Method in class Queue
 

M

main(String[]) - Static method in class Vypocet
Main
mozneMoznosti() - Method in class Stav
Nalezne mozne smysluplne operace nad danym uzlem/stavem (op1 = 2^0, op2 = 2^1, op3 = 2^2, op4 = 2^3, op5 = 2^4)

N

navstivene - Static variable in class Stav
 

O

operace(int) - Method in class Stav
Realizace operace nad danym stavem / prechod z uzlu o uroven niz

P

pocitej() - Method in class Stav
Spocita a vypise reseni problemu z daneho stavu

Q

q - Static variable in class Vypocet
 
Queue<Item> - Class in <Unnamed>
Trida Queue representuje frontu
Queue() - Constructor for class Queue
 

S

size() - Method in class Queue
 
Stav - Class in <Unnamed>
Trida Stav representuje uzel grafu
Stav(int, int, boolean) - Constructor for class Stav
Konstruktor tridy Stav

T

toStr() - Method in class Stav
Prevede stav do textove podoby

V

Vypocet - Class in <Unnamed>
Trida Vypocet representuje pokusnou tridu, ktera implementuje problem
Vypocet() - Constructor for class Vypocet
 

D E I J L M N O P Q S T V