Closeness centrality (cc; grsg_lcp_closeness_centrality) measures the average length of the shortest path between the node and all other nodes in the graph. The more central a node, the closer it is to all other nodes and the more likely information/movements can flow to other nodes. Closeness is computed as one divided by the average path lengths from a node to its neighbors, which assumes that important nodes are close to other nodes. The data were defined from least-cost paths (LCPs) constructed into minimum spanning trees (MSTs). We identified a threshold of the cc normalized value (>0.047) where patterns of network connectivity occurred in our graph. The cc identified leks with the greatest number of shortest paths between neighboring leks and therefore reflected the highest concentration of shortest paths between leks within an area. Leks identified with a cc value greater than our threshold were buffered by 15 km (inter-patch movement distance and distance of genetic flow), resulting in this dataset. Closeness centrality captured large areas with a higher density of sage-grouse, which we used to evaluate our derived population structure. Understanding wildlife population structure and connectivity can help managers identify conservation strategies, as structure can facilitate the study of population changes and habitat connectivity can provide information on dispersal and biodiversity. We developed an approach to define hierarchical population structure (in other words, demarcation of subpopulations) using graph theory (in other words, connectivity) from an amalgamation of biological inferences encompassing dispersal capabilities based on movements and genetic flow, seasonal habitat conditions, and functional processes (for example, selection of habitat at multiple scales) affecting movements. We applied our approach to greater sage-grouse (Centrocercus urophasianus), an upland gamebird species of conservation concern in western United States. We defined sage-grouse population structure by creating a cost surface, informed from functional processes of habitat characteristics to account for the resistance of inter-patch movements, and developing least-cost paths between breeding habitat sites (leks). The least-cost paths were combined into a multi-path graph construct for which we then used information on potential connectivity (dispersal distances) and functional connectivity (permeability of fragmented landscapes based on selection preferences) to decompose the graph into structures of subpopulations.