We'll present cuSTINGER - the first dynamic graph data structure for the GPU. We will start off by discussing the internals of the data structure. We'll compare cuSTINGER with CSR, a widely used static graph and matrix data representation, and show how that our dynamic graph data structure is within a few percent of static graph structures. We'll show additional performance results: time to initialize the data structure, time required to modify the graph (due to updates), and the update rate (which represents how many update per second cuSTINGER can deal with). Currently, cuSTINGER can sustain over 10 million updates per second. Lastly, we'll show a novel algorithm for counting triangles in a streaming environment which sustains million of updates per second.