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; 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; grouping nodes in the dynamic graph into node groups according to correlations between nodes and key nodes in the dynamic graph, wherein a key node refers to a node to which a change connection is directly connected; detecting position coincidence of nodes in the node group with other nodes occurring during the node group movement; and animating the elements of the running list on a computer display to demonstrate the dynamic graph, and animating movements of the node groups caused by the connection changes such that once nodes in the node group have position coincidence with nodes in another node group during the node movement then movement of the nodes in the other node group is started immediately.