In this talk, a SageMath package for investigating rigidity and flexibility of graphs is presented. The main focus is on the combinatorial properties related to NAC-colorings of a graph, since they provide some necessary/sufficient conditions on movability of the graph.