1. A method of animation planning for a dynamic graph, the method comprising the steps of: grouping changed nodes into atomic partitions according to the relationships between the changed nodes and existing nodes; and clustering the atomic partitions according to clustering distances between the atomic partitions to generate a running list for planning animation of node changes in the dynamic graph; wherein the running list includes elements selected from the group consisting of clusters of atomic partitions and atomic partitions.