{"id":32204094,"url":"https://github.com/fmestre1/lconnect","last_synced_at":"2025-10-22T04:51:03.913Z","repository":{"id":47348735,"uuid":"173175845","full_name":"FMestre1/lconnect","owner":"FMestre1","description":"Simple tools to compute landscape connectivity metrics","archived":false,"fork":false,"pushed_at":"2024-03-09T02:38:23.000Z","size":1984,"stargazers_count":8,"open_issues_count":3,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-10-14T02:36:30.787Z","etag":null,"topics":["connectivity","habitat-connectivity","landscape","metrics"],"latest_commit_sha":null,"homepage":"","language":"R","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/FMestre1.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2019-02-28T19:37:56.000Z","updated_at":"2025-07-09T14:06:49.000Z","dependencies_parsed_at":"2024-03-07T23:23:51.185Z","dependency_job_id":"332c5180-4942-4278-8772-aba863532b4f","html_url":"https://github.com/FMestre1/lconnect","commit_stats":{"total_commits":88,"total_committers":5,"mean_commits":17.6,"dds":"0.43181818181818177","last_synced_commit":"3a9f3c0194ee34a99e8cd621784d9eeb26ab574c"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/FMestre1/lconnect","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FMestre1%2Flconnect","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FMestre1%2Flconnect/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FMestre1%2Flconnect/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FMestre1%2Flconnect/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FMestre1","download_url":"https://codeload.github.com/FMestre1/lconnect/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FMestre1%2Flconnect/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":280382978,"owners_count":26321423,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-22T02:00:06.515Z","response_time":63,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["connectivity","habitat-connectivity","landscape","metrics"],"created_at":"2025-10-22T04:51:02.995Z","updated_at":"2025-10-22T04:51:03.904Z","avatar_url":"https://github.com/FMestre1.png","language":"R","funding_links":[],"categories":[],"sub_categories":[],"readme":" # lconnect\nSimple tools to derive landscape connectivity metrics and prioritize habitat patches\nbased on their contribution to overall connectivity.\n\nThe objective of this package is to provide the simplest possible approach to derive \nlandscape connectivity metrics.\n\n# These are the landscape connectivity metrics currently provided:\n\n##### Number of components #####\n’NC’ - Number of components (groups of interconnected patches) in the landscape (Urban\nand Keitt, 2001). Patches in the same component are considered to be accessible, \nwhile patches in different components are not. Highly connected landscapes have \nless components. Threshold dependent (dispersal distance).\n\n##### Number of links #####\n’LNK’ - Number of links connecting the patches. Considering that the maximum distance is\nthe species dispersal ability and that these graphs (landscapes) are binary, which \nmeans that the habitat patches are either connected or unconnected (Pascual-Hortal \nand Saura, 2006). Higher LNK implies higher connectivity. Threshold dependent \n(dispersal distance).\n\n##### Size of the Largest Component #####\n’SLC’ - Area of the largest component (group of interconnected patches) (Pascual-\nHortal and Saura, 2006). Threshold dependent (dispersal distance).\n\n##### Mean Size of Components #####\n’MSC’ - Mean component area (Pascual-Hortal and Saura, 2006). Threshold dependent \n(dispersal distance).\n\n##### Class coincidence probability #####\n’CCP’ - Class coincidence probability. It is defined as the probability that two \nrandomly chosen points within the habitat belong to the same component. \nRanges between 0 and 1 (Pascual-Hortal and Saura 2006). Higher CCP implies higher \nconnectivity. Threshold dependent (dispersal distance).\n\n##### Landscape coincidence probability #####\n’LCP’ - Landscape coincidence probability. It is defined as the probability that \ntwo randomly chosen points in the landscape (whether in an habitat patch or not) \nbelong to the same habitat component. Ranges between 0 and 1 (Pascual-Hortal and \nSaura 2006). Threshold dependent (dispersal distance).\n\n##### Characteristic path length #####\n’CPL’ - Characteristic path length. Mean of all the shortest paths between the \nnetwork nodes (habitat patches) (Minor and Urban, 2008). The shorter the CPL \nvalue the more connected the patches are. Threshold dependent (dispersal distance).\n\n##### Expected cluster size #####\n’ECS’ - Expected cluster (component) size. Mean cluster size of the clusters weighted \nby area. (O’Brien et al.,2006 and Fall et al, 2007). This represents the size \nof the component in which a randomly located point in an habitat patch would reside. \nAlthough it is informative regarding the area of the component, it does not provide \nany ecologically meaningful information regarding the total area of habitat, \nas an example: ECS increases with less isolated small components or patches, \nalthough the total habitat decreases(Laita et al. 2011). Threshold dependent \n(dispersal distance).\n \n##### Area-weighted flux #####\n’AWF’ - Area-weighted Flux. Evaluates the flow, weighted by area, between all \npairs of patches (Bunn et al. 2000 and Urban and Keitt 2001). The probability of \ndispersal between two patches (pij), required by the AWF formula, was computed \nusing pij=exp(-k*dij), where k is a constant making pij=0.5 at half the dispersal \ndistance defined by the user. Does not depend on any distance threshold (probabilistic).\n \n##### Integral index of connectivity #####\n’IIC’ - Integral index of connectivity. Index developed specifically for landscapes \nby Pascual-Hortal and Saura (2006). It is based on habitat availability and on a \nbinary connection model (as opposed to a probabilistic). It ranges from 0 to 1 \n(higher values indicating more connectivity). Threshold dependent (dispersal distance).\n\n##### References #####\nBunn, A. G., Urban, D. L., and Keitt, T. H. (2000). Landscape connectivity: a \nconservation application of graph theory. Journal of Environmental Management, \n59(4): 265-278.\n\nFall, A., Fortin, M. J., Manseau, M., and O’ Brien, D. (2007). Spatial graphs: \nprinciples and applications for habitat connectivity. Ecosystems, 10(3): 448-461.\n\nLaita, A., Kotiaho, J.S., Monkkonen, M. (2011). Graph-theoretic connectivity \nmeasures: what do they tell us about connectivity? Landscape Ecology, 26: 951-967.\n\nMinor, E. S., and Urban, D. L. (2008). A Graph-Theory Framework for Evaluating \nLandscape Connectivity and Conservation Planning. Conservation Biology, 22(2): 297-307.\n\nO’Brien, D., Manseau, M., Fall, A., and Fortin, M. J. (2006). Testing the importance \nof spatial configuration of winter habitat for woodland caribou: an application of \ngraph theory. Biological Conservation, 130(1): 70-83.\n\nPascual-Hortal, L., and Saura, S. (2006). Comparison and development of new \ngraph-based landscape connectivity indices: towards the priorization of habitat \npatches and corridors for conservation. Landscape Ecology, 21(7): 959-967.\n\nUrban, D., and Keitt, T. (2001). Landscape connectivity: a graph-theoretic \nperspective. Ecology, 82(5): 1205-1218.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffmestre1%2Flconnect","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffmestre1%2Flconnect","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffmestre1%2Flconnect/lists"}