lcp_centrality: Defining least-cost paths and graph theory centrality measures

We present software that creates least-cost path spanning trees, a least-cost path minimum spanning tree, and graph theory centrality measures. The software was developed to support identification of population structures--specifically, greater sage-grouse (Centrocercus urophasianus), but also support other species or graph theory applications where least-cost paths are desired. We used habitat patches (i.e., points or areas of habitat patches or some other feature representing nodes), and a user defined resistance surface defining the cost to move across the landscape. With the resulting graphs, the software applies centrality indices for additional interpretation of the graphs.