在Java中存储树结构

Question

I want to pre-compute some moves for my Game AI and store them on the disk, to be loaded at runtime. The moves are stored in a quinary tree and I'd appreciate it if you could recommend me some libraries that could let me to easily save them and restore them.

Answer 1

使用Java的序列化机制来持久化树是最简单的解决方案，并使用ObjectInputStream读取/ ObjectOutputStream来从磁盘写入序列化数据/将磁盘写入序列化数据。

Answer 2

As mentioned in the previous answers, you can make your tree implement the Serializable and let the JVM do everything for you (make sure all node classes are Serializable as well)

public class Tree implements Serializable{
   Node rootNode = ...

}

If your tree contains a large amount of data then you could probably trim down all the data that can be re-calculated when the tree is reloaded from disk, have a look at the Momento design pattern to get an idea on how this can be acheived.