{"query":"igraph.org","mode":"domain","best":{"domain":"igraph.org","status":"valid","tier":"listed","authority":56,"verified":false,"title":"R/igraph","summary":"R/igraph is an R package of the igraph network analysis library.","country":"US","country_source":"ip","publisher_country":null,"publisher_country_source":null,"hosting_country":"US","llms_txt":"https://r.igraph.org/llms.txt","llms_full_txt":null,"last_checked":"2026-10-24T22:13:42.348Z","agent_terms":null,"categories":["science-research","open-source","documentation-reference"],"capabilities":[],"inferred_tags":["r package","network analysis","graph theory","igraph","r documentation"],"audience":"developers","agent_uses":["read_docs"],"language":"en","platform_generated":false,"agent_summary":"Documentation site for R/igraph, the R package of the igraph network analysis library, with function references, articles and package index.","llms_txt_cached":"https://agentwebmap.com/v1/domain/igraph.org/llms.txt","agentic":"documentation","section_keys":["adjacency-matrices","all-vignettes","arpack-eigenvector-calculation","articles","bipartite-graphs","centrality-measures","centralization","chordal-graphs","cliques","code","community-detection-clustering","connected-components","construction","constructor-modifiers","constructor-specifications","contributions","contributors","conversion","convert-to-igraph","deterministic-constructors","documentation","efficiency","env-and-data","experimental-functions","functions-for-manipulating-graphs","graph-coloring","graph-cycles","graph-id-comparison-name-weight","graph-isomorphism","graph-matching","graph-motifs-and-subgraphs","graphical-degree-sequences","hierarchical-random-graphs","i-o-read-write-files","igraph-options","installation","installation-troubleshooting","interactive-functions","issue-authors","issue-contributors","latent-position-vector-samplers","license","low-level-operations","matrices","maximum-flow-and-connectivity","miscellaneous","package-index","paths","printing","processes-on-graphs","rewiring-functions","scan-statistics","similarity","spectral-embedding","stochastic-constructors-random-graph-models","structural-properties","structural-queries","trees","triangles-and-transitivity","utilities","versions","vertex-and-edge-sequences","vertex-edge-and-graph-attributes","visualization"],"section_partial":false,"section_indexed_at":"2026-10-24T22:13:51.249Z","why":["authority 56 (listed)","checked 362 minutes ago"]},"read":{"llms_txt":"https://r.igraph.org/llms.txt","llms_full_txt":null,"nested_llms_txt":[]},"terms":null,"health":{"ok":true,"status":"valid","tier":"listed","authority":56,"last_checked":"2026-10-24T22:13:42.348Z","checked_minutes_ago":361,"stale":false,"max_age_seconds":86400,"live_checked":false,"http_status":200,"last_valid":"2026-10-24T22:13:42.348Z","content_hash":"0a2c5458f581c3b14b1479ef70b2bf6f","documentation_indexed_at":"2026-10-24T22:13:41.360Z"},"sources":[],"match":{"strength":"domain","reason":"Exact domain or its registered publisher."},"provenance":{"selection":"directory","reranked":false,"verification":"domain_ownership","terms":"unknown","excerpts":"publisher_link_metadata","health":"stored_crawl"},"alternatives":[]}