The modularity score of a graph is the sum over all clusters of the number of edges in a cluster minus the number of edges expected by chance in the cluster. However, there are a few different ways of computing it (essentially due to how one defines edges expected by chance) but once a given definition of modularity is chosen, the modularity score of a graph only depends on the choice of clusters in the graph. What this means is: choose a definition of modularity then compute it for every partition of the graph you're interested in (possibly using different clustering algorithms). However, there are already algorithms that find the clusters that maximize the modularity so in principle, clustering algorithms that optimize another objective function are not expected to give the best modularity (unless of course they end up with the same partitioning of the graph).