This paper begins the study of reconfiguration zero forcing sets, and more specifically, graph. Given a base graph G, its graph, Z(G), is whose vertices are minimum sets G with an edge between B B′ Z(G) if only can be obtained from by changing single vertex G. It shown that forest connected, but many graphs disconnected. We characterize complete graphs, show star cannot computing takes 2Θ(n) op...