Graph

java.lang. Object +Object() <clinit>() :void #clone() :Object +equals(Object ) :boolean #finalize() :void +getClass() :Class +hashCode() :int +notify() :void +notifyAll() :void -registerNatives() :void +toString() :String +wait() :void +wait(long ) :void +wait(long , int ) :void

net.aerith.misao.util. Graph #number_of_nodes :int #branch :boolean[][] -max_steps :int -reached_flag :boolean[] +Graph(int nodes) +getNodeCount() :int +connect(int i, int j) :void +disconnect(int i, int j) :void +isConnected(int i, int j) :boolean +isReachable(int i, int j) :boolean +isReachableInStep(int i, int j, int steps) :boolean +getReachableIndexes(int index) :int[] +getReachableIndexesInStep(int index, int steps) :int[] -checkReachableIndexes(int index, int current_step) :void