# Using Sparse Graphs in JGraphT

JGraphT is a graph library containing very efficient and generic graph data-structures along with a large collection of state-of-the-art algorithms. In this post we are going to discuss how to execute algorithms on very large static graphs, containing million of vertices and billion of edges.

## Assumptions

The main assumption that we are going to make is that the graph the user is interested in is **static**. Static here means that the graph does not change after construction. This is normal when we want to perform bulk-processing of graphs, such as…