{
  "_id": "69d61bd710581d1350de853e",
  "Package": "igraph",
  "Title": "Network Analysis and Visualization",
  "Version": "2.2.2",
  "Authors@R": "c(\nperson(\"Gábor\", \"Csárdi\", , \"csardi.gabor@gmail.com\", role = \"aut\",\ncomment = c(ORCID = \"0000-0001-7098-9676\")),\nperson(\"Tamás\", \"Nepusz\", , \"ntamas@gmail.com\", role = \"aut\",\ncomment = c(ORCID = \"0000-0002-1451-338X\")),\nperson(\"Vincent\", \"Traag\", role = \"aut\",\ncomment = c(ORCID = \"0000-0003-3170-3879\")),\nperson(\"Szabolcs\", \"Horvát\", , \"szhorvat@gmail.com\", role = \"aut\",\ncomment = c(ORCID = \"0000-0002-3100-523X\")),\nperson(\"Fabio\", \"Zanini\", , \"fabio.zanini@unsw.edu.au\", role = \"aut\",\ncomment = c(ORCID = \"0000-0001-7097-8539\")),\nperson(\"Daniel\", \"Noom\", role = \"aut\"),\nperson(\"Kirill\", \"Müller\", , \"kirill@cynkra.com\", role = c(\"aut\", \"cre\"),\ncomment = c(ORCID = \"0000-0002-1416-3412\")),\nperson(\"Michael\", \"Antonov\", role = \"ctb\"),\nperson(\"Chan Zuckerberg Initiative\", role = \"fnd\",\ncomment = c(ROR = \"02qenvm24\")),\nperson(\"David\", \"Schoch\", , \"david.schoch@cynkra.com\", role = \"aut\",\ncomment = c(ORCID = \"0000-0003-2952-4812\")),\nperson(\"Maëlle\", \"Salmon\", , \"maelle@cynkra.com\", role = \"aut\",\ncomment = c(ORCID = \"0000-0002-2815-0399\"))\n)",
  "Description": "Routines for simple graphs and network analysis. It can\nhandle large graphs very well and provides functions for\ngenerating random and regular graphs, graph visualization,\ncentrality methods and much more.",
  "License": "GPL (>= 2)",
  "URL": "https://r.igraph.org/, https://igraph.org/,\nhttps://igraph.discourse.group/",
  "BugReports": "https://github.com/igraph/rigraph/issues",
  "VignetteBuilder": "knitr",
  "Config/build/compilation-database": "false",
  "Config/build/never-clean": "true",
  "Config/comment/compilation-database": "Generate manually with\npkgload:::generate_db() for faster pkgload::load_all()",
  "Config/Needs/build": "r-lib/roxygen2, devtools, irlba, pkgconfig,\nigraph/igraph.r2cdocs, moodymudskipper/devtag",
  "Config/Needs/coverage": "covr",
  "Config/Needs/website": "here, readr, tibble, xmlparsedata, xml2",
  "Config/testthat/edition": "3",
  "Config/testthat/parallel": "true",
  "Config/testthat/start-first": "aaa-auto, vs-es, scan, vs-operators,\nweakref, watts.strogatz.game",
  "Encoding": "UTF-8",
  "Roxygen": "list(markdown = TRUE, roclets = c(\"collate\", \"rd\",\n\"namespace\", \"igraph.r2cdocs::cdocs_roclet\",\n\"devtag::dev_roclet\"), packages = \"igraph.r2cdocs\")",
  "RoxygenNote": "7.3.3.9000",
  "SystemRequirements": "libxml2 (optional), glpk (>= 4.57, optional)",
  "Config/pak/sysreqs": "libglpk-dev libxml2-dev",
  "Repository": "https://r-multiverse.r-universe.dev",
  "Date/Publication": "2026-02-12 09:55:12 UTC",
  "RemoteUrl": "https://github.com/igraph/rigraph",
  "RemoteRef": "v2.2.2",
  "RemoteSha": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
  "NeedsCompilation": "yes",
  "Packaged": {
    "Date": "2026-04-07 08:29:25 UTC",
    "User": "root"
  },
  "Author": "Gábor Csárdi [aut] (ORCID: <https://orcid.org/0000-0001-7098-9676>),\nTamás Nepusz [aut] (ORCID: <https://orcid.org/0000-0002-1451-338X>),\nVincent Traag [aut] (ORCID: <https://orcid.org/0000-0003-3170-3879>),\nSzabolcs Horvát [aut] (ORCID: <https://orcid.org/0000-0002-3100-523X>),\nFabio Zanini [aut] (ORCID: <https://orcid.org/0000-0001-7097-8539>),\nDaniel Noom [aut],\nKirill Müller [aut, cre] (ORCID:\n<https://orcid.org/0000-0002-1416-3412>),\nMichael Antonov [ctb],\nChan Zuckerberg Initiative [fnd] (ROR: <https://ror.org/02qenvm24>),\nDavid Schoch [aut] (ORCID: <https://orcid.org/0000-0003-2952-4812>),\nMaëlle Salmon [aut] (ORCID: <https://orcid.org/0000-0002-2815-0399>)",
  "Maintainer": "Kirill Müller <kirill@cynkra.com>",
  "MD5sum": "b2ea42fd53781f3c31ea9db4604f2155",
  "_user": "r-multiverse",
  "_type": "src",
  "_file": "igraph_2.2.2.tar.gz",
  "_fileid": "008444f0df3646287bd1a6407df581e7136ef0d0447a5b3e0a1a76cb49a3a4a5",
  "_filesize": 7464790,
  "_sha256": "008444f0df3646287bd1a6407df581e7136ef0d0447a5b3e0a1a76cb49a3a4a5",
  "_created": "2026-04-07T08:29:25.000Z",
  "_published": "2026-04-08T09:11:51.328Z",
  "_distro": "noble",
  "_jobs": [
    {
      "job": 70393075637,
      "time": 320,
      "config": "linux-devel-arm64",
      "r": "4.6.0",
      "check": "OK",
      "artifact": "6301888260"
    },
    {
      "job": 70393075440,
      "time": 344,
      "config": "linux-devel-x86_64",
      "r": "4.6.0",
      "check": "OK",
      "artifact": "6301894812"
    },
    {
      "job": 70393075990,
      "time": 312,
      "config": "linux-release-arm64",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6301885487"
    },
    {
      "job": 70393075670,
      "time": 308,
      "config": "linux-release-x86_64",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6301884800"
    },
    {
      "job": 70393075411,
      "time": 292,
      "config": "macos-oldrel-arm64",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6302201190"
    },
    {
      "job": 70393075561,
      "time": 505,
      "config": "macos-oldrel-x86_64",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6302223921"
    },
    {
      "job": 70393075690,
      "time": 294,
      "config": "macos-release-arm64",
      "r": "4.6.0",
      "check": "WARNING",
      "artifact": "6302204018"
    },
    {
      "job": 70393075387,
      "time": 590,
      "config": "macos-release-x86_64",
      "r": "4.6.0",
      "check": "WARNING",
      "artifact": "6324026442"
    },
    {
      "job": 70393075391,
      "time": 464,
      "config": "source",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6301796354"
    },
    {
      "job": 70393075263,
      "time": 122,
      "config": "wasm-release",
      "r": "4.5.1",
      "check": "FAIL",
      "artifact": ""
    },
    {
      "job": 70393075703,
      "time": 572,
      "config": "windows-devel",
      "r": "4.7.0",
      "check": "WARNING",
      "artifact": "6301960560"
    },
    {
      "job": 70393075555,
      "time": 561,
      "config": "windows-oldrel",
      "r": "4.5.3",
      "check": "OK",
      "artifact": "6301957435"
    },
    {
      "job": 70393075521,
      "time": 623,
      "config": "windows-release",
      "r": "4.6.0",
      "check": "WARNING",
      "artifact": "6301975618"
    }
  ],
  "_buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292",
  "_status": "success",
  "_host": "GitHub-Actions",
  "_upstream": "https://github.com/igraph/rigraph",
  "_commit": {
    "id": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
    "author": "Kirill Müller <kirill@cynkra.com>",
    "committer": "Kirill Müller <kirill@cynkra.com>",
    "message": "Reimplement upgrade of igraph objects\n",
    "time": 1770890112
  },
  "_maintainer": {
    "name": "Kirill Müller",
    "email": "kirill@cynkra.com",
    "login": "krlmlr",
    "orcid": "0000-0002-1416-3412",
    "uuid": 1741643
  },
  "_registered": true,
  "_dependencies": [
    {
      "package": "methods",
      "role": "Depends"
    },
    {
      "package": "R",
      "version": ">= 3.5.0",
      "role": "Depends"
    },
    {
      "package": "cpp11",
      "version": ">= 0.5.0",
      "role": "LinkingTo"
    },
    {
      "package": "cli",
      "role": "Imports"
    },
    {
      "package": "graphics",
      "role": "Imports"
    },
    {
      "package": "grDevices",
      "role": "Imports"
    },
    {
      "package": "lifecycle",
      "role": "Imports"
    },
    {
      "package": "magrittr",
      "role": "Imports"
    },
    {
      "package": "Matrix",
      "role": "Imports"
    },
    {
      "package": "pkgconfig",
      "version": ">= 2.0.0",
      "role": "Imports"
    },
    {
      "package": "rlang",
      "version": ">= 1.1.0",
      "role": "Imports"
    },
    {
      "package": "stats",
      "role": "Imports"
    },
    {
      "package": "utils",
      "role": "Imports"
    },
    {
      "package": "vctrs",
      "role": "Imports"
    },
    {
      "package": "ape",
      "version": ">= 5.7-0.1",
      "role": "Suggests"
    },
    {
      "package": "callr",
      "role": "Suggests"
    },
    {
      "package": "decor",
      "role": "Suggests"
    },
    {
      "package": "digest",
      "role": "Suggests"
    },
    {
      "package": "igraphdata",
      "role": "Suggests"
    },
    {
      "package": "knitr",
      "role": "Suggests"
    },
    {
      "package": "rgl",
      "version": ">= 1.3.14",
      "role": "Suggests"
    },
    {
      "package": "rmarkdown",
      "role": "Suggests"
    },
    {
      "package": "scales",
      "role": "Suggests"
    },
    {
      "package": "stats4",
      "role": "Suggests"
    },
    {
      "package": "tcltk",
      "role": "Suggests"
    },
    {
      "package": "testthat",
      "role": "Suggests"
    },
    {
      "package": "vdiffr",
      "role": "Suggests"
    },
    {
      "package": "withr",
      "role": "Suggests"
    },
    {
      "package": "graph",
      "role": "Enhances"
    }
  ],
  "_owner": "igraph",
  "_selfowned": false,
  "_usedby": 2071,
  "_updates": [
    {
      "week": "2025-15",
      "n": 20
    },
    {
      "week": "2025-16",
      "n": 2
    },
    {
      "week": "2025-17",
      "n": 10
    },
    {
      "week": "2025-18",
      "n": 18
    },
    {
      "week": "2025-22",
      "n": 1
    },
    {
      "week": "2025-23",
      "n": 8
    },
    {
      "week": "2025-24",
      "n": 7
    },
    {
      "week": "2025-26",
      "n": 28
    },
    {
      "week": "2025-27",
      "n": 51
    },
    {
      "week": "2025-28",
      "n": 18
    },
    {
      "week": "2025-29",
      "n": 13
    },
    {
      "week": "2025-30",
      "n": 31
    },
    {
      "week": "2025-31",
      "n": 23
    },
    {
      "week": "2025-32",
      "n": 5
    },
    {
      "week": "2025-33",
      "n": 34
    },
    {
      "week": "2025-34",
      "n": 23
    },
    {
      "week": "2025-35",
      "n": 1
    },
    {
      "week": "2025-36",
      "n": 23
    },
    {
      "week": "2025-37",
      "n": 18
    },
    {
      "week": "2025-38",
      "n": 3
    },
    {
      "week": "2025-39",
      "n": 17
    },
    {
      "week": "2025-40",
      "n": 7
    },
    {
      "week": "2025-41",
      "n": 2
    },
    {
      "week": "2025-42",
      "n": 7
    },
    {
      "week": "2025-43",
      "n": 12
    },
    {
      "week": "2025-44",
      "n": 2
    },
    {
      "week": "2026-05",
      "n": 5
    },
    {
      "week": "2026-07",
      "n": 2
    }
  ],
  "_tags": [
    {
      "name": "v2.1.4.9037",
      "date": "2025-04-08"
    },
    {
      "name": "v2.1.4.9038",
      "date": "2025-04-10"
    },
    {
      "name": "v2.1.4.9039",
      "date": "2025-04-11"
    },
    {
      "name": "v2.1.4.9040",
      "date": "2025-04-12"
    },
    {
      "name": "v2.1.4.9041",
      "date": "2025-04-13"
    },
    {
      "name": "v2.1.4.9042",
      "date": "2025-04-15"
    },
    {
      "name": "v2.1.4.9043",
      "date": "2025-04-23"
    },
    {
      "name": "v2.1.4.9044",
      "date": "2025-04-30"
    },
    {
      "name": "v2.1.4.9045",
      "date": "2025-05-01"
    },
    {
      "name": "v2.1.4.9046",
      "date": "2025-05-02"
    },
    {
      "name": "v2.1.4.9047",
      "date": "2025-06-02"
    },
    {
      "name": "v2.1.4.9048",
      "date": "2025-06-06"
    },
    {
      "name": "v2.1.4.9049",
      "date": "2025-06-09"
    },
    {
      "name": "v2.1.4.9050",
      "date": "2025-06-13"
    },
    {
      "name": "v2.1.4.9051",
      "date": "2025-06-14"
    },
    {
      "name": "v2.1.4.9052",
      "date": "2025-06-26"
    },
    {
      "name": "v2.1.4.9053",
      "date": "2025-06-27"
    },
    {
      "name": "v2.1.4.9054",
      "date": "2025-06-28"
    },
    {
      "name": "v2.1.4.9055",
      "date": "2025-06-29"
    },
    {
      "name": "v2.1.4.9056",
      "date": "2025-07-04"
    },
    {
      "name": "v2.1.4.9057",
      "date": "2025-07-05"
    },
    {
      "name": "v2.1.4.9058",
      "date": "2025-07-07"
    },
    {
      "name": "v2.1.4.9059",
      "date": "2025-07-08"
    },
    {
      "name": "v2.1.4.9060",
      "date": "2025-07-09"
    },
    {
      "name": "v2.1.4.9061",
      "date": "2025-07-10"
    },
    {
      "name": "v2.1.4.9062",
      "date": "2025-07-11"
    },
    {
      "name": "v2.1.4.9063",
      "date": "2025-07-12"
    },
    {
      "name": "v2.1.4.9064",
      "date": "2025-07-16"
    },
    {
      "name": "v2.1.4.9065",
      "date": "2025-07-17"
    },
    {
      "name": "v2.1.4.9066",
      "date": "2025-07-20"
    },
    {
      "name": "v2.1.4.9067",
      "date": "2025-07-21"
    },
    {
      "name": "v2.1.4.9068",
      "date": "2025-07-22"
    },
    {
      "name": "v2.1.4.9069",
      "date": "2025-07-23"
    },
    {
      "name": "v2.1.4.9070",
      "date": "2025-07-24"
    },
    {
      "name": "v2.1.4.9071",
      "date": "2025-07-26"
    },
    {
      "name": "v2.1.4.9072",
      "date": "2025-07-28"
    },
    {
      "name": "v2.1.4.9073",
      "date": "2025-07-29"
    },
    {
      "name": "v2.1.4.9074",
      "date": "2025-07-30"
    },
    {
      "name": "v2.1.4.9075",
      "date": "2025-07-31"
    },
    {
      "name": "v2.1.4.9076",
      "date": "2025-08-01"
    },
    {
      "name": "v2.1.4.9077",
      "date": "2025-08-02"
    },
    {
      "name": "v2.1.4.9078",
      "date": "2025-08-05"
    },
    {
      "name": "v2.1.4.9079",
      "date": "2025-08-08"
    },
    {
      "name": "v2.1.4.9080",
      "date": "2025-08-18"
    },
    {
      "name": "v2.1.4.9081",
      "date": "2025-08-19"
    },
    {
      "name": "v2.1.4.9082",
      "date": "2025-08-20"
    },
    {
      "name": "v2.1.4.9083",
      "date": "2025-08-22"
    },
    {
      "name": "v2.1.4.9084",
      "date": "2025-08-24"
    },
    {
      "name": "v2.1.4.9085",
      "date": "2025-08-25"
    },
    {
      "name": "v2.1.4.9086",
      "date": "2025-09-02"
    },
    {
      "name": "v2.1.4.9087",
      "date": "2025-09-04"
    },
    {
      "name": "v2.1.4.9088",
      "date": "2025-09-05"
    },
    {
      "name": "v2.1.4.9089",
      "date": "2025-09-06"
    },
    {
      "name": "v2.1.99.9901",
      "date": "2025-09-08"
    },
    {
      "name": "v2.1.99.9902",
      "date": "2025-09-09"
    },
    {
      "name": "v2.1.99.9903",
      "date": "2025-09-11"
    },
    {
      "name": "v2.1.99.9904",
      "date": "2025-09-12"
    },
    {
      "name": "v2.1.99.9905",
      "date": "2025-09-13"
    },
    {
      "name": "v2.1.99.9906",
      "date": "2025-09-15"
    },
    {
      "name": "v2.1.99.9907",
      "date": "2025-09-16"
    },
    {
      "name": "v2.1.99.9908",
      "date": "2025-09-23"
    },
    {
      "name": "v2.2.0.9000",
      "date": "2025-09-25"
    },
    {
      "name": "v2.2.0.9001",
      "date": "2025-10-03"
    },
    {
      "name": "v2.2.0.9002",
      "date": "2025-10-06"
    },
    {
      "name": "v2.2.0",
      "date": "2025-10-09"
    },
    {
      "name": "v2.2.0.9003",
      "date": "2025-10-14"
    },
    {
      "name": "v2.2.0.9004",
      "date": "2025-10-18"
    },
    {
      "name": "v2.2.0.9005",
      "date": "2025-10-20"
    },
    {
      "name": "v2.2.0.9006",
      "date": "2025-10-25"
    },
    {
      "name": "v2.2.1.9000",
      "date": "2025-10-26"
    },
    {
      "name": "v2.2.1",
      "date": "2025-10-27"
    },
    {
      "name": "v2.2.1.9001",
      "date": "2025-10-27"
    },
    {
      "name": "v2.2.1.9002",
      "date": "2025-10-28"
    },
    {
      "name": "v2.2.1.9003",
      "date": "2025-10-29"
    },
    {
      "name": "v2.2.1.9004",
      "date": "2025-11-02"
    },
    {
      "name": "v2.2.1.9005",
      "date": "2025-11-03"
    },
    {
      "name": "v2.2.1.9006",
      "date": "2025-11-04"
    },
    {
      "name": "v2.2.1.9007",
      "date": "2025-11-08"
    },
    {
      "name": "v2.2.1.9008",
      "date": "2025-11-10"
    },
    {
      "name": "v2.2.1.9009",
      "date": "2025-11-12"
    },
    {
      "name": "v2.2.1.9010",
      "date": "2025-11-13"
    },
    {
      "name": "v2.2.1.9011",
      "date": "2025-11-14"
    },
    {
      "name": "v2.2.1.9012",
      "date": "2025-11-15"
    },
    {
      "name": "v2.2.1.9013",
      "date": "2025-11-17"
    },
    {
      "name": "v2.2.1.9014",
      "date": "2025-11-18"
    },
    {
      "name": "v2.2.1.9015",
      "date": "2026-01-14"
    },
    {
      "name": "v2.2.1.9016",
      "date": "2026-01-20"
    },
    {
      "name": "v2.2.1.9017",
      "date": "2026-01-24"
    },
    {
      "name": "v2.2.1.9018",
      "date": "2026-01-25"
    },
    {
      "name": "v2.2.1.9019",
      "date": "2026-01-26"
    },
    {
      "name": "v2.2.1.9020",
      "date": "2026-01-27"
    },
    {
      "name": "v2.2.1.9021",
      "date": "2026-02-05"
    },
    {
      "name": "v2.2.2",
      "date": "2026-02-12"
    },
    {
      "name": "v2.2.1.9022",
      "date": "2026-02-13"
    },
    {
      "name": "v2.2.1.9023",
      "date": "2026-02-14"
    },
    {
      "name": "v2.2.1.9024",
      "date": "2026-02-16"
    },
    {
      "name": "v2.2.2.9001",
      "date": "2026-02-24"
    },
    {
      "name": "v2.2.2.9002",
      "date": "2026-03-06"
    },
    {
      "name": "v2.2.2.9003",
      "date": "2026-03-11"
    },
    {
      "name": "v2.2.2.9004",
      "date": "2026-03-13"
    },
    {
      "name": "v2.2.2.9005",
      "date": "2026-04-01"
    },
    {
      "name": "v2.2.3",
      "date": "2026-04-07"
    }
  ],
  "_topics": [
    "complex-networks",
    "graph-algorithms",
    "graph-theory",
    "mathematics",
    "network-analysis",
    "network-graph",
    "fortran",
    "libxml2",
    "glpk",
    "openblas",
    "cpp"
  ],
  "_stars": 612,
  "_contributors": [
    {
      "user": "gaborcsardi",
      "count": 1504,
      "uuid": 660288
    },
    {
      "user": "krlmlr",
      "count": 1414,
      "uuid": 1741643
    },
    {
      "user": "maelle",
      "count": 967,
      "uuid": 8360597
    },
    {
      "user": "ntamas",
      "count": 508,
      "uuid": 195637
    },
    {
      "user": "szhorvat",
      "count": 316,
      "uuid": 1212871
    },
    {
      "user": "antonov548",
      "count": 182,
      "uuid": 22891541
    },
    {
      "user": "vtraag",
      "count": 109,
      "uuid": 6057804
    },
    {
      "user": "copilot",
      "count": 73,
      "uuid": 198982749
    },
    {
      "user": "schochastics",
      "count": 63,
      "uuid": 17147355
    },
    {
      "user": "adalisan",
      "count": 16,
      "uuid": 1790714
    },
    {
      "user": "ngmaclaren",
      "count": 9,
      "uuid": 45513933
    },
    {
      "user": "iosonofabio",
      "count": 6,
      "uuid": 1200640
    },
    {
      "user": "dmurdoch",
      "count": 6,
      "uuid": 1935680
    },
    {
      "user": "kalibera",
      "count": 4,
      "uuid": 1734520
    },
    {
      "user": "pupamanyu",
      "count": 4,
      "uuid": 1937416
    },
    {
      "user": "olivroy",
      "count": 3,
      "uuid": 52606734
    },
    {
      "user": "hadley",
      "count": 2,
      "uuid": 4196
    },
    {
      "user": "matyasch",
      "count": 2,
      "uuid": 47661203
    },
    {
      "user": "stibu81",
      "count": 2,
      "uuid": 7131000
    },
    {
      "user": "clpippel",
      "count": 2,
      "uuid": 9609214
    },
    {
      "user": "wael-sadek",
      "count": 2,
      "uuid": 42678896
    },
    {
      "user": "dougmet",
      "count": 2,
      "uuid": 5878305
    },
    {
      "user": "covoes",
      "count": 1,
      "uuid": 4109501
    },
    {
      "user": "smoe",
      "count": 1,
      "uuid": 207407
    },
    {
      "user": "simoncarrignon",
      "count": 1,
      "uuid": 4749455
    },
    {
      "user": "zeehio",
      "count": 1,
      "uuid": 75441
    },
    {
      "user": "richardfergie",
      "count": 1,
      "uuid": 2488905
    },
    {
      "user": "raulzr",
      "count": 1,
      "uuid": 13007941
    },
    {
      "user": "rahulhp",
      "count": 1,
      "uuid": 4871132
    },
    {
      "user": "peranti",
      "count": 1,
      "uuid": 9472741
    },
    {
      "user": "das-intensity",
      "count": 1,
      "uuid": 12521554
    },
    {
      "user": "michaelchirico",
      "count": 1,
      "uuid": 7606389
    },
    {
      "user": "ahmohamed",
      "count": 1,
      "uuid": 6384340
    },
    {
      "user": "mirca",
      "count": 1,
      "uuid": 13077051
    },
    {
      "user": "adriandiazlab",
      "count": 1,
      "uuid": 50892826
    },
    {
      "user": "a-lambda",
      "count": 1,
      "uuid": 155024809
    },
    {
      "user": "aleszib",
      "count": 1,
      "uuid": 9567948
    },
    {
      "user": "person-c",
      "count": 1,
      "uuid": 93318795
    },
    {
      "user": "cynthiahqy",
      "count": 1,
      "uuid": 29718979
    },
    {
      "user": "etheleon",
      "count": 1,
      "uuid": 2868858
    },
    {
      "user": "knwng",
      "count": 1,
      "uuid": 26247277
    },
    {
      "user": "stnava",
      "count": 1,
      "uuid": 324222
    },
    {
      "user": "kasterma",
      "count": 1,
      "uuid": 421437
    },
    {
      "user": "cfhammill",
      "count": 1,
      "uuid": 7467038
    },
    {
      "user": "clhunsen",
      "count": 1,
      "uuid": 2649820
    },
    {
      "user": "rundel",
      "count": 1,
      "uuid": 273926
    },
    {
      "user": "qsz13",
      "count": 1,
      "uuid": 4075761
    },
    {
      "user": "dexgroves",
      "count": 1,
      "uuid": 10374782
    },
    {
      "user": "qulogic",
      "count": 1,
      "uuid": 302469
    },
    {
      "user": "eqmooring",
      "count": 1,
      "uuid": 43585225
    },
    {
      "user": "gvegayon",
      "count": 1,
      "uuid": 893619
    },
    {
      "user": "dalloliogm",
      "count": 1,
      "uuid": 14500
    },
    {
      "user": "hosseinazari",
      "count": 1,
      "uuid": 971459
    },
    {
      "user": "hclimente",
      "count": 1,
      "uuid": 5196281
    },
    {
      "user": "jeroen",
      "count": 1,
      "uuid": 216319
    },
    {
      "user": "jj",
      "count": 1,
      "uuid": 500
    },
    {
      "user": "jooolia",
      "count": 1,
      "uuid": 1899722
    },
    {
      "user": "reuning",
      "count": 1,
      "uuid": 6343832
    },
    {
      "user": "louisaslett",
      "count": 1,
      "uuid": 5246125
    },
    {
      "user": "majoromask",
      "count": 1,
      "uuid": 19700954
    },
    {
      "user": "matthieustigler",
      "count": 1,
      "uuid": 108840
    },
    {
      "user": "mhils",
      "count": 1,
      "uuid": 1019198
    },
    {
      "user": "mfansler",
      "count": 1,
      "uuid": 1182216
    }
  ],
  "_userbio": {
    "uuid": 161461790,
    "type": "organization",
    "name": "R-multiverse",
    "description": "A community-curated collection of R package releases, powered by R-universe"
  },
  "_downloads": {
    "count": 482740,
    "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/igraph"
  },
  "_mentions": 1555,
  "_devurl": "https://github.com/igraph/rigraph",
  "_pkgdown": "https://r.igraph.org/",
  "_searchresults": 39168,
  "_fortran": true,
  "_rbuild": "4.5.3",
  "_assets": [
    "extra/citation.cff",
    "extra/citation.html",
    "extra/citation.json",
    "extra/citation.txt",
    "extra/contents.json",
    "extra/igraph.html",
    "extra/NEWS.html",
    "extra/NEWS.txt",
    "extra/readme.html",
    "extra/readme.md",
    "manual.pdf"
  ],
  "_homeurl": "https://github.com/igraph/rigraph",
  "_realowner": "igraph",
  "_cranurl": true,
  "_releases": [
    {
      "version": "0.1.1",
      "date": "2006-03-01"
    },
    {
      "version": "0.1.2",
      "date": "2006-03-29"
    },
    {
      "version": "0.2",
      "date": "2006-08-23"
    },
    {
      "version": "0.2.1",
      "date": "2006-08-25"
    },
    {
      "version": "0.3.1",
      "date": "2006-12-07"
    },
    {
      "version": "0.3.2",
      "date": "2006-12-15"
    },
    {
      "version": "0.3.3",
      "date": "2007-02-28"
    },
    {
      "version": "0.4",
      "date": "2007-05-22"
    },
    {
      "version": "0.4.1",
      "date": "2007-05-23"
    },
    {
      "version": "0.4.2",
      "date": "2007-06-07"
    },
    {
      "version": "0.4.3",
      "date": "2007-08-09"
    },
    {
      "version": "0.4.4",
      "date": "2007-10-03"
    },
    {
      "version": "0.4.5",
      "date": "2007-12-24"
    },
    {
      "version": "0.5",
      "date": "2008-02-13"
    },
    {
      "version": "0.5.1",
      "date": "2008-07-12"
    },
    {
      "version": "0.5.2",
      "date": "2009-04-14"
    },
    {
      "version": "0.5.2-2",
      "date": "2009-05-08"
    },
    {
      "version": "0.5.3",
      "date": "2009-11-22"
    },
    {
      "version": "0.5.4",
      "date": "2010-08-06"
    },
    {
      "version": "0.5.4-1",
      "date": "2010-08-19"
    },
    {
      "version": "0.5.5",
      "date": "2010-10-28"
    },
    {
      "version": "0.5.5-1",
      "date": "2010-12-17"
    },
    {
      "version": "0.5.5-2",
      "date": "2011-03-21"
    },
    {
      "version": "0.5.5-3",
      "date": "2011-10-20"
    },
    {
      "version": "0.5.5-4",
      "date": "2011-12-13"
    },
    {
      "version": "0.6",
      "date": "2012-06-14"
    },
    {
      "version": "0.6-1",
      "date": "2012-06-16"
    },
    {
      "version": "0.6-2",
      "date": "2012-06-20"
    },
    {
      "version": "0.6-3",
      "date": "2012-10-17"
    },
    {
      "version": "0.6.4",
      "date": "2013-02-04"
    },
    {
      "version": "0.6.5",
      "date": "2013-02-25"
    },
    {
      "version": "0.6.5-1",
      "date": "2013-02-28"
    },
    {
      "version": "0.6.5-2",
      "date": "2013-05-23"
    },
    {
      "version": "0.6.6",
      "date": "2013-10-28"
    },
    {
      "version": "0.7.0",
      "date": "2014-02-05"
    },
    {
      "version": "0.7.1",
      "date": "2014-04-22"
    },
    {
      "version": "1.0.0",
      "date": "2015-06-24"
    },
    {
      "version": "1.0.1",
      "date": "2015-06-26"
    },
    {
      "version": "1.1.1",
      "date": "2017-07-16"
    },
    {
      "version": "1.1.2",
      "date": "2017-07-21"
    },
    {
      "version": "1.2.1",
      "date": "2018-03-10"
    },
    {
      "version": "1.2.2",
      "date": "2018-07-27"
    },
    {
      "version": "1.2.3",
      "date": "2019-02-10"
    },
    {
      "version": "1.2.4",
      "date": "2019-02-13"
    },
    {
      "version": "1.2.4.1",
      "date": "2019-04-22"
    },
    {
      "version": "1.2.4.2",
      "date": "2019-11-27"
    },
    {
      "version": "1.2.5",
      "date": "2020-03-19"
    },
    {
      "version": "1.2.6",
      "date": "2020-10-06"
    },
    {
      "version": "1.2.7",
      "date": "2021-10-15"
    },
    {
      "version": "1.2.8",
      "date": "2021-11-07"
    },
    {
      "version": "1.2.9",
      "date": "2021-11-24"
    },
    {
      "version": "1.2.10",
      "date": "2021-12-15"
    },
    {
      "version": "1.2.11",
      "date": "2022-01-05"
    },
    {
      "version": "1.3.0",
      "date": "2022-04-01"
    },
    {
      "version": "1.3.1",
      "date": "2022-04-20"
    },
    {
      "version": "1.3.2",
      "date": "2022-06-13"
    },
    {
      "version": "1.3.3",
      "date": "2022-07-15"
    },
    {
      "version": "1.3.4",
      "date": "2022-07-19"
    },
    {
      "version": "1.3.5",
      "date": "2022-09-22"
    },
    {
      "version": "1.4.0",
      "date": "2023-02-10"
    },
    {
      "version": "1.4.1",
      "date": "2023-02-24"
    },
    {
      "version": "1.4.2",
      "date": "2023-04-07"
    },
    {
      "version": "1.4.3",
      "date": "2023-05-22"
    },
    {
      "version": "1.5.0",
      "date": "2023-06-16"
    },
    {
      "version": "1.5.0.1",
      "date": "2023-07-23"
    },
    {
      "version": "1.5.1",
      "date": "2023-08-10"
    },
    {
      "version": "1.6.0",
      "date": "2023-12-11"
    },
    {
      "version": "2.0.1",
      "date": "2024-01-29"
    },
    {
      "version": "2.0.1.1",
      "date": "2024-01-30"
    },
    {
      "version": "2.0.2",
      "date": "2024-02-18"
    },
    {
      "version": "2.0.3",
      "date": "2024-03-13"
    },
    {
      "version": "2.1.1",
      "date": "2024-10-19"
    },
    {
      "version": "2.1.2",
      "date": "2024-12-07"
    },
    {
      "version": "2.1.3",
      "date": "2025-01-07"
    },
    {
      "version": "2.1.4",
      "date": "2025-01-23"
    },
    {
      "version": "2.2.0",
      "date": "2025-10-13"
    },
    {
      "version": "2.2.1",
      "date": "2025-10-27"
    },
    {
      "version": "2.2.2",
      "date": "2026-02-16"
    },
    {
      "version": "2.2.3",
      "date": "2026-04-07"
    }
  ],
  "_exports": [
    ".data",
    ".env",
    ".from",
    ".inc",
    ".innei",
    ".nei",
    ".outnei",
    ".to",
    "%--%",
    "%->%",
    "%<-%",
    "%>%",
    "%c%",
    "%du%",
    "%m%",
    "%s%",
    "%u%",
    "add_edges",
    "add_layout_",
    "add_shape",
    "add_vertices",
    "add.edges",
    "add.vertex.shape",
    "add.vertices",
    "adhesion",
    "adjacent_vertices",
    "adjacent.triangles",
    "aging.ba.game",
    "aging.barabasi.game",
    "aging.prefatt.game",
    "algorithm",
    "align_layout",
    "all_shortest_paths",
    "all_simple_paths",
    "alpha_centrality",
    "alpha.centrality",
    "any_loop",
    "any_multiple",
    "are_adjacent",
    "are.connected",
    "arpack",
    "arpack_defaults",
    "articulation_points",
    "articulation.points",
    "as_adj",
    "as_adj_edge_list",
    "as_adj_list",
    "as_adjacency_matrix",
    "as_biadjacency_matrix",
    "as_bipartite",
    "as_data_frame",
    "as_directed",
    "as_edgelist",
    "as_graphnel",
    "as_ids",
    "as_incidence_matrix",
    "as_long_data_frame",
    "as_membership",
    "as_phylo",
    "as_star",
    "as_tree",
    "as_undirected",
    "as.directed",
    "as.igraph",
    "as.undirected",
    "assortativity",
    "assortativity_degree",
    "assortativity_nominal",
    "assortativity.degree",
    "assortativity.nominal",
    "asym_pref",
    "asymmetric.preference.game",
    "atlas",
    "authority_score",
    "authority.score",
    "autocurve.edges",
    "automorphism_group",
    "automorphisms",
    "average_local_efficiency",
    "average.path.length",
    "ba.game",
    "barabasi.game",
    "betweenness",
    "betweenness.estimate",
    "bfs",
    "bibcoupling",
    "biconnected_components",
    "biconnected.components",
    "bipartite",
    "bipartite_gnm",
    "bipartite_gnp",
    "bipartite_graph",
    "bipartite_mapping",
    "bipartite_projection",
    "bipartite_projection_size",
    "bipartite.mapping",
    "bipartite.projection",
    "bipartite.projection.size",
    "bipartite.random.game",
    "blockGraphs",
    "blocks",
    "bonpow",
    "bridges",
    "callaway.traits.game",
    "canonical_permutation",
    "canonical.permutation",
    "categorical_pal",
    "centr_betw",
    "centr_betw_tmax",
    "centr_clo",
    "centr_clo_tmax",
    "centr_degree",
    "centr_degree_tmax",
    "centr_eigen",
    "centr_eigen_tmax",
    "centralization.betweenness",
    "centralization.betweenness.tmax",
    "centralization.closeness",
    "centralization.closeness.tmax",
    "centralization.degree",
    "centralization.degree.tmax",
    "centralization.evcent",
    "centralization.evcent.tmax",
    "centralize",
    "centralize.scores",
    "chordal_ring",
    "chung_lu",
    "cit_cit_types",
    "cit_types",
    "cited.type.game",
    "citing.cited.type.game",
    "clique_num",
    "clique_size_counts",
    "clique.number",
    "cliques",
    "closeness",
    "closeness.estimate",
    "cluster_edge_betweenness",
    "cluster_fast_greedy",
    "cluster_fluid_communities",
    "cluster_infomap",
    "cluster_label_prop",
    "cluster_leading_eigen",
    "cluster_leiden",
    "cluster_louvain",
    "cluster_optimal",
    "cluster_spinglass",
    "cluster_walktrap",
    "cluster.distribution",
    "clusters",
    "cocitation",
    "code_len",
    "code.length",
    "cohesion",
    "cohesive_blocks",
    "cohesive.blocks",
    "communities",
    "compare",
    "complementer",
    "component_distribution",
    "component_wise",
    "components",
    "compose",
    "connect",
    "connect.neighborhood",
    "consensus_tree",
    "console",
    "constraint",
    "contract",
    "contract.vertices",
    "convex_hull",
    "convex.hull",
    "coreness",
    "count_automorphisms",
    "count_components",
    "count_isomorphisms",
    "count_max_cliques",
    "count_motifs",
    "count_multiple",
    "count_subgraph_isomorphisms",
    "count_triangles",
    "count.multiple",
    "create.communities",
    "crossing",
    "curve_multiple",
    "cut_at",
    "cutat",
    "de_bruijn_graph",
    "decompose",
    "decompose.graph",
    "degree",
    "degree_distribution",
    "degree.distribution",
    "degree.sequence.game",
    "degseq",
    "delete_edge_attr",
    "delete_edges",
    "delete_graph_attr",
    "delete_vertex_attr",
    "delete_vertices",
    "delete.edges",
    "delete.vertices",
    "dendPlot",
    "dfs",
    "diameter",
    "difference",
    "dim_select",
    "directed_graph",
    "disjoint_union",
    "distance_table",
    "distances",
    "diverging_pal",
    "diversity",
    "dominator_tree",
    "dominator.tree",
    "dot_product",
    "drl_defaults",
    "dyad_census",
    "dyad.census",
    "E",
    "E<-",
    "each_edge",
    "eccentricity",
    "ecount",
    "edge",
    "edge_attr",
    "edge_attr_names",
    "edge_attr<-",
    "edge_betweenness",
    "edge_connectivity",
    "edge_density",
    "edge_disjoint_paths",
    "edge.attributes",
    "edge.attributes<-",
    "edge.betweenness",
    "edge.betweenness.community",
    "edge.betweenness.estimate",
    "edge.connectivity",
    "edge.disjoint.paths",
    "edges",
    "ego",
    "ego_size",
    "eigen_centrality",
    "embed_adjacency_matrix",
    "embed_laplacian_matrix",
    "empty_graph",
    "ends",
    "erdos.renyi.game",
    "establishment.game",
    "estimate_betweenness",
    "estimate_closeness",
    "estimate_edge_betweenness",
    "eulerian_cycle",
    "eulerian_path",
    "evcent",
    "export_pajek",
    "exportPajek",
    "farthest_vertices",
    "farthest.nodes",
    "fastgreedy.community",
    "feedback_arc_set",
    "feedback_vertex_set",
    "find_cycle",
    "fit_hrg",
    "fit_power_law",
    "forest.fire.game",
    "from_adjacency",
    "from_data_frame",
    "from_edgelist",
    "from_incidence_matrix",
    "from_literal",
    "from_prufer",
    "full_bipartite_graph",
    "full_citation_graph",
    "full_graph",
    "get_diameter",
    "get_edge_ids",
    "get.adjacency",
    "get.adjedgelist",
    "get.adjlist",
    "get.all.shortest.paths",
    "get.data.frame",
    "get.diameter",
    "get.edge",
    "get.edge.attribute",
    "get.edge.ids",
    "get.edgelist",
    "get.edges",
    "get.graph.attribute",
    "get.incidence",
    "get.shortest.paths",
    "get.stochastic",
    "get.vertex.attribute",
    "getIgraphOpt",
    "girth",
    "global_efficiency",
    "gnm",
    "gnp",
    "gorder",
    "graph",
    "graph_",
    "graph_attr",
    "graph_attr_names",
    "graph_attr<-",
    "graph_center",
    "graph_from_adj_list",
    "graph_from_adjacency_matrix",
    "graph_from_atlas",
    "graph_from_biadjacency_matrix",
    "graph_from_data_frame",
    "graph_from_edgelist",
    "graph_from_graphdb",
    "graph_from_graphnel",
    "graph_from_incidence_matrix",
    "graph_from_isomorphism_class",
    "graph_from_lcf",
    "graph_from_literal",
    "graph_id",
    "graph_version",
    "graph.adhesion",
    "graph.adjacency",
    "graph.adjlist",
    "graph.atlas",
    "graph.attributes",
    "graph.attributes<-",
    "graph.automorphisms",
    "graph.bfs",
    "graph.bipartite",
    "graph.cohesion",
    "graph.complementer",
    "graph.compose",
    "graph.coreness",
    "graph.count.isomorphisms.vf2",
    "graph.count.subisomorphisms.vf2",
    "graph.data.frame",
    "graph.de.bruijn",
    "graph.density",
    "graph.dfs",
    "graph.difference",
    "graph.disjoint.union",
    "graph.diversity",
    "graph.edgelist",
    "graph.eigen",
    "graph.empty",
    "graph.extended.chordal.ring",
    "graph.famous",
    "graph.formula",
    "graph.full",
    "graph.full.bipartite",
    "graph.full.citation",
    "graph.get.isomorphisms.vf2",
    "graph.get.subisomorphisms.vf2",
    "graph.graphdb",
    "graph.incidence",
    "graph.intersection",
    "graph.isoclass",
    "graph.isoclass.subgraph",
    "graph.isocreate",
    "graph.isomorphic",
    "graph.isomorphic.bliss",
    "graph.isomorphic.vf2",
    "graph.kautz",
    "graph.knn",
    "graph.laplacian",
    "graph.lattice",
    "graph.lcf",
    "graph.maxflow",
    "graph.mincut",
    "graph.motifs",
    "graph.motifs.est",
    "graph.motifs.no",
    "graph.neighborhood",
    "graph.ring",
    "graph.star",
    "graph.strength",
    "graph.subisomorphic.lad",
    "graph.subisomorphic.vf2",
    "graph.tree",
    "graph.union",
    "graphlet_basis",
    "graphlet_proj",
    "graphlets",
    "graphlets.candidate.basis",
    "graphlets.project",
    "graphs_from_cohesive_blocks",
    "greedy_vertex_coloring",
    "grg",
    "grg.game",
    "groups",
    "growing",
    "growing.random.game",
    "gsize",
    "harmonic_centrality",
    "has_eulerian_cycle",
    "has_eulerian_path",
    "has.multiple",
    "head_of",
    "head_print",
    "hierarchical_sbm",
    "hierarchy",
    "hits_scores",
    "hrg",
    "hrg_tree",
    "hrg.consensus",
    "hrg.create",
    "hrg.dendrogram",
    "hrg.fit",
    "hrg.game",
    "hrg.predict",
    "hub_score",
    "hub.score",
    "identical_graphs",
    "igraph_opt",
    "igraph_options",
    "igraph_version",
    "igraph.console",
    "igraph.drl.coarsen",
    "igraph.drl.coarsest",
    "igraph.drl.default",
    "igraph.drl.final",
    "igraph.drl.refine",
    "igraph.from.graphNEL",
    "igraph.options",
    "igraph.sample",
    "igraph.shape.noclip",
    "igraph.shape.noplot",
    "igraph.to.graphNEL",
    "igraph.version",
    "in_circle",
    "incident",
    "incident_edges",
    "indent_print",
    "independence_number",
    "independence.number",
    "independent.vertex.sets",
    "induced_subgraph",
    "induced.subgraph",
    "infomap.community",
    "interconnected.islands.game",
    "intersection",
    "is_acyclic",
    "is_biconnected",
    "is_bipartite",
    "is_chordal",
    "is_clique",
    "is_complete",
    "is_connected",
    "is_dag",
    "is_degseq",
    "is_directed",
    "is_forest",
    "is_graphical",
    "is_hierarchical",
    "is_igraph",
    "is_isomorphic_to",
    "is_ivs",
    "is_matching",
    "is_max_matching",
    "is_min_separator",
    "is_named",
    "is_printer_callback",
    "is_separator",
    "is_simple",
    "is_subgraph_isomorphic_to",
    "is_tree",
    "is_weighted",
    "is.bipartite",
    "is.chordal",
    "is.connected",
    "is.dag",
    "is.degree.sequence",
    "is.directed",
    "is.graphical.degree.sequence",
    "is.hierarchical",
    "is.igraph",
    "is.loop",
    "is.matching",
    "is.maximal.matching",
    "is.minimal.separator",
    "is.multiple",
    "is.mutual",
    "is.named",
    "is.separator",
    "is.simple",
    "is.weighted",
    "isomorphic",
    "isomorphism_class",
    "isomorphisms",
    "ivs",
    "ivs_size",
    "k_shortest_paths",
    "k.regular.game",
    "kautz_graph",
    "keeping_degseq",
    "knn",
    "label.propagation.community",
    "laplacian_matrix",
    "largest_cliques",
    "largest_component",
    "largest_ivs",
    "largest_weighted_cliques",
    "largest.cliques",
    "largest.independent.vertex.sets",
    "last_cit",
    "lastcit.game",
    "lattice",
    "layout_",
    "layout_as_bipartite",
    "layout_as_star",
    "layout_as_tree",
    "layout_components",
    "layout_in_circle",
    "layout_nicely",
    "layout_on_grid",
    "layout_on_sphere",
    "layout_randomly",
    "layout_with_dh",
    "layout_with_drl",
    "layout_with_fr",
    "layout_with_gem",
    "layout_with_graphopt",
    "layout_with_kk",
    "layout_with_lgl",
    "layout_with_mds",
    "layout_with_sugiyama",
    "layout.auto",
    "layout.bipartite",
    "layout.circle",
    "layout.davidson.harel",
    "layout.drl",
    "layout.fruchterman.reingold",
    "layout.fruchterman.reingold.grid",
    "layout.gem",
    "layout.graphopt",
    "layout.grid",
    "layout.grid.3d",
    "layout.kamada.kawai",
    "layout.lgl",
    "layout.mds",
    "layout.merge",
    "layout.norm",
    "layout.random",
    "layout.reingold.tilford",
    "layout.sphere",
    "layout.spring",
    "layout.star",
    "layout.sugiyama",
    "layout.svd",
    "leading.eigenvector.community",
    "line_graph",
    "line.graph",
    "list.edge.attributes",
    "list.graph.attributes",
    "list.vertex.attributes",
    "local_efficiency",
    "local_scan",
    "make_",
    "make_bipartite_graph",
    "make_chordal_ring",
    "make_clusters",
    "make_de_bruijn_graph",
    "make_directed_graph",
    "make_ego_graph",
    "make_empty_graph",
    "make_from_prufer",
    "make_full_bipartite_graph",
    "make_full_citation_graph",
    "make_full_graph",
    "make_graph",
    "make_kautz_graph",
    "make_lattice",
    "make_line_graph",
    "make_neighborhood_graph",
    "make_ring",
    "make_star",
    "make_tree",
    "make_undirected_graph",
    "match_vertices",
    "max_bipartite_match",
    "max_cardinality",
    "max_cliques",
    "max_cohesion",
    "max_degree",
    "max_flow",
    "max_ivs",
    "maxcohesion",
    "maximal_ivs",
    "maximal.cliques",
    "maximal.cliques.count",
    "maximal.independent.vertex.sets",
    "maximum.bipartite.matching",
    "maximum.cardinality.search",
    "mean_distance",
    "membership",
    "merge_coords",
    "merges",
    "min_cut",
    "min_separators",
    "min_st_separators",
    "minimal.st.separators",
    "minimum.size.separators",
    "minimum.spanning.tree",
    "mod.matrix",
    "modularity",
    "modularity_matrix",
    "motifs",
    "mst",
    "multilevel.community",
    "neighborhood",
    "neighborhood_size",
    "neighborhood.size",
    "neighbors",
    "nicely",
    "no.clusters",
    "norm_coords",
    "normalize",
    "on_grid",
    "on_sphere",
    "optimal.community",
    "pa",
    "pa_age",
    "page_rank",
    "page.rank",
    "parent",
    "path",
    "path.length.hist",
    "permute",
    "permute.vertices",
    "piecewise.layout",
    "plot_dendrogram",
    "plot_hierarchy",
    "plot.igraph",
    "plotHierarchy",
    "power_centrality",
    "power.law.fit",
    "predict_edges",
    "pref",
    "preference.game",
    "print_all",
    "print.igraph",
    "printer_callback",
    "r_pal",
    "radius",
    "random_edge_walk",
    "random_walk",
    "random.graph.game",
    "randomly",
    "read_graph",
    "read.graph",
    "realize_bipartite_degseq",
    "realize_degseq",
    "reciprocity",
    "remove.edge.attribute",
    "remove.graph.attribute",
    "remove.vertex.attribute",
    "reverse_edges",
    "rewire",
    "rglplot",
    "ring",
    "running_mean",
    "running.mean",
    "sample_",
    "sample_asym_pref",
    "sample_bipartite",
    "sample_bipartite_gnm",
    "sample_bipartite_gnp",
    "sample_chung_lu",
    "sample_cit_cit_types",
    "sample_cit_types",
    "sample_correlated_gnp",
    "sample_correlated_gnp_pair",
    "sample_degseq",
    "sample_dirichlet",
    "sample_dot_product",
    "sample_fitness",
    "sample_fitness_pl",
    "sample_forestfire",
    "sample_gnm",
    "sample_gnp",
    "sample_grg",
    "sample_growing",
    "sample_hierarchical_sbm",
    "sample_hrg",
    "sample_islands",
    "sample_k_regular",
    "sample_last_cit",
    "sample_motifs",
    "sample_pa",
    "sample_pa_age",
    "sample_pref",
    "sample_sbm",
    "sample_seq",
    "sample_smallworld",
    "sample_spanning_tree",
    "sample_sphere_surface",
    "sample_sphere_volume",
    "sample_traits",
    "sample_traits_callaway",
    "sample_tree",
    "sbm",
    "sbm.game",
    "scan_stat",
    "sequential_pal",
    "set_edge_attr",
    "set_graph_attr",
    "set_vertex_attr",
    "set_vertex_attrs",
    "set.edge.attribute",
    "set.graph.attribute",
    "set.vertex.attribute",
    "shape_noclip",
    "shape_noplot",
    "shapes",
    "shortest_paths",
    "shortest.paths",
    "show_trace",
    "showtrace",
    "similarity",
    "similarity.dice",
    "similarity.invlogweighted",
    "similarity.jaccard",
    "simple_cycles",
    "simplified",
    "simplify",
    "simplify_and_colorize",
    "sir",
    "sizes",
    "smallworld",
    "spectrum",
    "spinglass.community",
    "split_join_distance",
    "st_cuts",
    "st_min_cuts",
    "star",
    "static.fitness.game",
    "static.power.law.game",
    "stCuts",
    "stMincuts",
    "stochastic_matrix",
    "strength",
    "subcomponent",
    "subgraph",
    "subgraph_centrality",
    "subgraph_from_edges",
    "subgraph_isomorphic",
    "subgraph_isomorphisms",
    "subgraph.centrality",
    "subgraph.edges",
    "tail_of",
    "time_bins",
    "tk_canvas",
    "tk_center",
    "tk_close",
    "tk_coords",
    "tk_fit",
    "tk_off",
    "tk_postscript",
    "tk_reshape",
    "tk_rotate",
    "tk_set_coords",
    "tkplot",
    "tkplot.canvas",
    "tkplot.center",
    "tkplot.close",
    "tkplot.export.postscript",
    "tkplot.fit.to.screen",
    "tkplot.getcoords",
    "tkplot.off",
    "tkplot.reshape",
    "tkplot.rotate",
    "tkplot.setcoords",
    "to_prufer",
    "topo_sort",
    "topological.sort",
    "traits",
    "traits_callaway",
    "transitivity",
    "tree",
    "triad_census",
    "triad.census",
    "triangles",
    "undirected_graph",
    "unfold_tree",
    "unfold.tree",
    "union",
    "upgrade_graph",
    "V",
    "V<-",
    "vcount",
    "vertex",
    "vertex_attr",
    "vertex_attr_names",
    "vertex_attr<-",
    "vertex_connectivity",
    "vertex_disjoint_paths",
    "vertex.attributes",
    "vertex.attributes<-",
    "vertex.connectivity",
    "vertex.disjoint.paths",
    "vertex.shapes",
    "vertices",
    "voronoi_cells",
    "walktrap.community",
    "watts.strogatz.game",
    "weighted_clique_num",
    "weighted_cliques",
    "which_loop",
    "which_multiple",
    "which_mutual",
    "with_dh",
    "with_drl",
    "with_edge_",
    "with_fr",
    "with_gem",
    "with_graph_",
    "with_graphopt",
    "with_igraph_opt",
    "with_kk",
    "with_lgl",
    "with_mds",
    "with_sugiyama",
    "with_vertex_",
    "without_attr",
    "without_loops",
    "without_multiples",
    "write_graph",
    "write.graph"
  ],
  "_help": [
    {
      "page": "sub-.igraph",
      "title": "Query and manipulate a graph as it were an adjacency matrix",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "[.igraph"
      ]
    },
    {
      "page": "sub-sub-.igraph",
      "title": "Query and manipulate a graph as it were an adjacency list",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "[[.igraph"
      ]
    },
    {
      "page": "pipe",
      "title": "Magrittr's pipes",
      "topics": [
        "%>%"
      ]
    },
    {
      "page": "plus-.igraph",
      "title": "Add vertices, edges or another graph to a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "+.igraph"
      ]
    },
    {
      "page": "add_edges",
      "title": "Add edges to a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "add_edges"
      ]
    },
    {
      "page": "add_layout_",
      "title": "Add layout to graph",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "add_layout_"
      ]
    },
    {
      "page": "add_vertices",
      "title": "Add vertices to a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "add_vertices"
      ]
    },
    {
      "page": "adjacent_vertices",
      "title": "Adjacent vertices of multiple vertices in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "adjacent_vertices"
      ]
    },
    {
      "page": "align_layout",
      "title": "Align a vertex layout This function centers a vertex layout on the coordinate system origin and rotates the layout to achieve a visually pleasing alignment with the coordinate axes. Doing this is particularly useful with force-directed layouts such as 'layout_with_fr()'.",
      "topics": [
        "align_layout"
      ]
    },
    {
      "page": "all_simple_paths",
      "title": "List all simple paths from one source",
      "concept": [
        "paths"
      ],
      "topics": [
        "all_simple_paths"
      ]
    },
    {
      "page": "alpha_centrality",
      "title": "Find Bonacich alpha centrality scores of network positions",
      "concept": [
        "centrality"
      ],
      "topics": [
        "alpha_centrality"
      ]
    },
    {
      "page": "are_adjacent",
      "title": "Are two vertices adjacent?",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "are_adjacent"
      ]
    },
    {
      "page": "arpack",
      "title": "ARPACK eigenvector calculation",
      "concept": [
        "arpack"
      ],
      "topics": [
        "arpack",
        "arpack-options",
        "arpack.unpack.complex",
        "arpack_defaults"
      ]
    },
    {
      "page": "articulation_points",
      "title": "Articulation points and bridges of a graph",
      "concept": [
        "components"
      ],
      "topics": [
        "articulation_points",
        "bridges"
      ]
    },
    {
      "page": "as_adj_list",
      "title": "Adjacency lists",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_adj_edge_list",
        "as_adj_list"
      ]
    },
    {
      "page": "as_adjacency_matrix",
      "title": "Convert a graph to an adjacency matrix",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_adjacency_matrix"
      ]
    },
    {
      "page": "as_biadjacency_matrix",
      "title": "Bipartite adjacency matrix of a bipartite graph",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_biadjacency_matrix"
      ]
    },
    {
      "page": "graph_from_data_frame",
      "title": "Creating igraph graphs from data frames or vice-versa",
      "concept": [
        "biadjacency",
        "conversion"
      ],
      "topics": [
        "as_data_frame",
        "from_data_frame",
        "graph_from_data_frame"
      ]
    },
    {
      "page": "as_directed",
      "title": "Convert between directed and undirected graphs",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_directed",
        "as_undirected"
      ]
    },
    {
      "page": "as_edgelist",
      "title": "Convert a graph to an edge list",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_edgelist"
      ]
    },
    {
      "page": "as_graphnel",
      "title": "Convert igraph graphs to graphNEL objects from the graph package",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_graphnel"
      ]
    },
    {
      "page": "as_ids",
      "title": "Convert a vertex or edge sequence to an ordinary vector",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "as_ids",
        "as_ids.igraph.es",
        "as_ids.igraph.vs"
      ]
    },
    {
      "page": "as_long_data_frame",
      "title": "Convert a graph to a long data frame",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as_long_data_frame"
      ]
    },
    {
      "page": "as_membership",
      "title": "Declare a numeric vector as a membership vector",
      "concept": [
        "community"
      ],
      "topics": [
        "as_membership"
      ]
    },
    {
      "page": "as.igraph",
      "title": "Conversion to igraph",
      "topics": [
        "as.igraph",
        "as.igraph.igraphHRG"
      ]
    },
    {
      "page": "as.matrix.igraph",
      "title": "Convert igraph objects to adjacency or edge list matrices",
      "concept": [
        "conversion"
      ],
      "topics": [
        "as.matrix.igraph"
      ]
    },
    {
      "page": "assortativity",
      "title": "Assortativity coefficient",
      "topics": [
        "assortativity",
        "assortativity_degree",
        "assortativity_nominal"
      ]
    },
    {
      "page": "hub_score",
      "title": "Kleinberg's authority centrality scores.",
      "concept": [
        "centrality"
      ],
      "topics": [
        "authority_score",
        "hub_score"
      ]
    },
    {
      "page": "automorphism_group",
      "title": "Generating set of the automorphism group of a graph",
      "concept": [
        "graph automorphism"
      ],
      "topics": [
        "automorphism_group"
      ]
    },
    {
      "page": "betweenness",
      "title": "Vertex and edge betweenness centrality",
      "concept": [
        "centrality"
      ],
      "topics": [
        "betweenness",
        "betweenness.estimate",
        "edge.betweenness.estimate",
        "edge_betweenness"
      ]
    },
    {
      "page": "bfs",
      "title": "Breadth-first search",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "bfs"
      ]
    },
    {
      "page": "biconnected_components",
      "title": "Biconnected components",
      "concept": [
        "components"
      ],
      "topics": [
        "biconnected_components"
      ]
    },
    {
      "page": "sample_bipartite_gnm",
      "title": "Bipartite random graphs",
      "concept": [
        "games"
      ],
      "topics": [
        "bipartite_gnm",
        "bipartite_gnp",
        "sample_bipartite_gnm",
        "sample_bipartite_gnp"
      ]
    },
    {
      "page": "bipartite_mapping",
      "title": "Decide whether a graph is bipartite",
      "concept": [
        "bipartite"
      ],
      "topics": [
        "bipartite_mapping"
      ]
    },
    {
      "page": "bipartite_projection",
      "title": "Project a bipartite graph",
      "concept": [
        "bipartite"
      ],
      "topics": [
        "bipartite_projection",
        "bipartite_projection_size"
      ]
    },
    {
      "page": "c.igraph.es",
      "title": "Concatenate edge sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "c.igraph.es"
      ]
    },
    {
      "page": "c.igraph.vs",
      "title": "Concatenate vertex sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "c.igraph.vs"
      ]
    },
    {
      "page": "canonical_permutation",
      "title": "Canonical permutation of a graph",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "canonical_permutation"
      ]
    },
    {
      "page": "categorical_pal",
      "title": "Palette for categories",
      "concept": [
        "palettes"
      ],
      "topics": [
        "categorical_pal"
      ]
    },
    {
      "page": "centr_betw",
      "title": "Centralize a graph according to the betweenness of vertices",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_betw"
      ]
    },
    {
      "page": "centr_betw_tmax",
      "title": "Theoretical maximum for betweenness centralization",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_betw_tmax"
      ]
    },
    {
      "page": "centr_clo",
      "title": "Centralize a graph according to the closeness of vertices",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_clo"
      ]
    },
    {
      "page": "centr_clo_tmax",
      "title": "Theoretical maximum for closeness centralization",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_clo_tmax"
      ]
    },
    {
      "page": "centr_degree",
      "title": "Centralize a graph according to the degrees of vertices",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_degree"
      ]
    },
    {
      "page": "centr_degree_tmax",
      "title": "Theoretical maximum for degree centralization",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_degree_tmax"
      ]
    },
    {
      "page": "centr_eigen",
      "title": "Centralize a graph according to the eigenvector centrality of vertices",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_eigen"
      ]
    },
    {
      "page": "centr_eigen_tmax",
      "title": "Theoretical maximum for eigenvector centralization",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centr_eigen_tmax"
      ]
    },
    {
      "page": "centralize",
      "title": "Centralization of a graph",
      "concept": [
        "centralization related"
      ],
      "topics": [
        "centralization",
        "centralize"
      ]
    },
    {
      "page": "cliques",
      "title": "Functions to find cliques, i.e. complete subgraphs in a graph",
      "concept": [
        "cliques"
      ],
      "topics": [
        "cliques",
        "clique_num",
        "clique_size_counts",
        "count_max_cliques",
        "is_clique",
        "largest_cliques",
        "largest_weighted_cliques",
        "max_cliques",
        "weighted_clique_num"
      ]
    },
    {
      "page": "closeness",
      "title": "Closeness centrality of vertices",
      "concept": [
        "centrality"
      ],
      "topics": [
        "closeness",
        "closeness.estimate"
      ]
    },
    {
      "page": "cluster_edge_betweenness",
      "title": "Community structure detection based on edge betweenness",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_edge_betweenness"
      ]
    },
    {
      "page": "cluster_fast_greedy",
      "title": "Community structure via greedy optimization of modularity",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_fast_greedy"
      ]
    },
    {
      "page": "cluster_fluid_communities",
      "title": "Community detection algorithm based on interacting fluids",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_fluid_communities"
      ]
    },
    {
      "page": "cluster_infomap",
      "title": "Infomap community finding",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_infomap"
      ]
    },
    {
      "page": "cluster_label_prop",
      "title": "Finding communities based on propagating labels",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_label_prop"
      ]
    },
    {
      "page": "cluster_leading_eigen",
      "title": "Community structure detecting based on the leading eigenvector of the community matrix",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_leading_eigen"
      ]
    },
    {
      "page": "cluster_leiden",
      "title": "Finding community structure of a graph using the Leiden algorithm of Traag, van Eck & Waltman.",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_leiden"
      ]
    },
    {
      "page": "cluster_louvain",
      "title": "Finding community structure by multi-level optimization of modularity",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_louvain"
      ]
    },
    {
      "page": "cluster_optimal",
      "title": "Optimal community structure",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_optimal"
      ]
    },
    {
      "page": "cluster_spinglass",
      "title": "Finding communities in graphs based on statistical meachanics",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_spinglass"
      ]
    },
    {
      "page": "cluster_walktrap",
      "title": "Community structure via short random walks",
      "concept": [
        "community"
      ],
      "topics": [
        "cluster_walktrap"
      ]
    },
    {
      "page": "cocitation",
      "title": "Cocitation coupling",
      "concept": [
        "cocitation"
      ],
      "topics": [
        "bibcoupling",
        "cocitation"
      ]
    },
    {
      "page": "cohesive_blocks",
      "title": "Calculate Cohesive Blocks",
      "concept": [
        "cohesive.blocks"
      ],
      "topics": [
        "blocks",
        "cohesion.cohesiveBlocks",
        "cohesiveBlocks",
        "cohesive_blocks",
        "export_pajek",
        "graphs_from_cohesive_blocks",
        "hierarchy",
        "length.cohesiveBlocks",
        "max_cohesion",
        "parent",
        "plot.cohesiveBlocks",
        "plot_hierarchy",
        "print.cohesiveBlocks",
        "summary.cohesiveBlocks"
      ]
    },
    {
      "page": "compare",
      "title": "Compares community structures using various metrics",
      "concept": [
        "community"
      ],
      "topics": [
        "compare",
        "compare.communities",
        "compare.membership"
      ]
    },
    {
      "page": "complementer",
      "title": "Complementer of a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "complementer"
      ]
    },
    {
      "page": "components",
      "title": "Connected components of a graph",
      "concept": [
        "components",
        "structural.properties"
      ],
      "topics": [
        "components",
        "component_distribution",
        "count_components",
        "is_connected",
        "largest_component"
      ]
    },
    {
      "page": "component_wise",
      "title": "Component-wise layout",
      "concept": [
        "graph layouts",
        "layout modifiers"
      ],
      "topics": [
        "component_wise"
      ]
    },
    {
      "page": "compose",
      "title": "Compose two graphs as binary relations",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "%c%",
        "compose"
      ]
    },
    {
      "page": "ego",
      "title": "Neighborhood of graph vertices",
      "concept": [
        "functions for manipulating graph structure",
        "structural.properties"
      ],
      "topics": [
        "connect",
        "ego",
        "ego_graph",
        "ego_size",
        "make_ego_graph",
        "make_neighborhood_graph",
        "neighborhood",
        "neighborhood_size"
      ]
    },
    {
      "page": "consensus_tree",
      "title": "Create a consensus tree from several hierarchical random graph models",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "consensus_tree"
      ]
    },
    {
      "page": "console",
      "title": "The igraph console",
      "concept": [
        "console"
      ],
      "topics": [
        "console"
      ]
    },
    {
      "page": "constraint",
      "title": "Burt's constraint",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "constraint"
      ]
    },
    {
      "page": "contract",
      "title": "Contract several vertices into a single one",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "contract"
      ]
    },
    {
      "page": "convex_hull",
      "title": "Convex hull of a set of vertices",
      "concept": [
        "other"
      ],
      "topics": [
        "convex_hull"
      ]
    },
    {
      "page": "coreness",
      "title": "K-core decomposition of graphs",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "coreness"
      ]
    },
    {
      "page": "count_automorphisms",
      "title": "Number of automorphisms",
      "concept": [
        "graph automorphism"
      ],
      "topics": [
        "count_automorphisms"
      ]
    },
    {
      "page": "count_isomorphisms",
      "title": "Count the number of isomorphic mappings between two graphs",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "count_isomorphisms",
        "graph.count.isomorphisms.vf2"
      ]
    },
    {
      "page": "count_motifs",
      "title": "Graph motifs",
      "concept": [
        "graph motifs"
      ],
      "topics": [
        "count_motifs"
      ]
    },
    {
      "page": "count_subgraph_isomorphisms",
      "title": "Count the isomorphic mappings between a graph and the subgraphs of another graph",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "count_subgraph_isomorphisms",
        "graph.count.subisomorphisms.vf2"
      ]
    },
    {
      "page": "curve_multiple",
      "title": "Optimal edge curvature when plotting graphs",
      "concept": [
        "plot.common"
      ],
      "topics": [
        "curve_multiple"
      ]
    },
    {
      "page": "decompose",
      "title": "Decompose a graph into components",
      "concept": [
        "components"
      ],
      "topics": [
        "decompose"
      ]
    },
    {
      "page": "degree",
      "title": "Degree and degree distribution of the vertices",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "degree",
        "degree_distribution",
        "max_degree"
      ]
    },
    {
      "page": "delete_edge_attr",
      "title": "Delete an edge attribute",
      "concept": [
        "attributes"
      ],
      "topics": [
        "delete_edge_attr"
      ]
    },
    {
      "page": "delete_edges",
      "title": "Delete edges from a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "delete_edges"
      ]
    },
    {
      "page": "delete_graph_attr",
      "title": "Delete a graph attribute",
      "concept": [
        "attributes"
      ],
      "topics": [
        "delete_graph_attr"
      ]
    },
    {
      "page": "delete_vertex_attr",
      "title": "Delete a vertex attribute",
      "concept": [
        "attributes"
      ],
      "topics": [
        "delete_vertex_attr"
      ]
    },
    {
      "page": "delete_vertices",
      "title": "Delete vertices from a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "delete_vertices"
      ]
    },
    {
      "page": "dfs",
      "title": "Depth-first search",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "dfs"
      ]
    },
    {
      "page": "diameter",
      "title": "Diameter of a graph",
      "concept": [
        "paths"
      ],
      "topics": [
        "diameter",
        "farthest_vertices",
        "get_diameter"
      ]
    },
    {
      "page": "difference",
      "title": "Difference of two sets",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "difference"
      ]
    },
    {
      "page": "difference.igraph",
      "title": "Difference of graphs",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "%m%",
        "difference.igraph"
      ]
    },
    {
      "page": "difference.igraph.es",
      "title": "Difference of edge sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "difference.igraph.es"
      ]
    },
    {
      "page": "difference.igraph.vs",
      "title": "Difference of vertex sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "difference.igraph.vs"
      ]
    },
    {
      "page": "dim_select",
      "title": "Dimensionality selection for singular values using profile likelihood.",
      "concept": [
        "embedding"
      ],
      "topics": [
        "dim_select"
      ]
    },
    {
      "page": "disjoint_union",
      "title": "Disjoint union of graphs",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "%du%",
        "disjoint_union"
      ]
    },
    {
      "page": "distances",
      "title": "Shortest (directed or undirected) paths between vertices",
      "concept": [
        "paths",
        "structural.properties"
      ],
      "topics": [
        "all_shortest_paths",
        "distances",
        "distance_table",
        "mean_distance",
        "shortest_paths"
      ]
    },
    {
      "page": "diverging_pal",
      "title": "Diverging palette",
      "concept": [
        "palettes"
      ],
      "topics": [
        "diverging_pal"
      ]
    },
    {
      "page": "diversity",
      "title": "Graph diversity",
      "concept": [
        "centrality"
      ],
      "topics": [
        "diversity"
      ]
    },
    {
      "page": "dominator_tree",
      "title": "Dominator tree",
      "concept": [
        "flow"
      ],
      "topics": [
        "dominator_tree"
      ]
    },
    {
      "page": "dot-data",
      "title": "'.data' and '.env' pronouns",
      "concept": [
        "env-and-data"
      ],
      "topics": [
        ".data",
        ".env",
        "dot-data",
        "dot-env"
      ]
    },
    {
      "page": "dyad_census",
      "title": "Dyad census of a graph",
      "concept": [
        "graph motifs"
      ],
      "topics": [
        "dyad_census"
      ]
    },
    {
      "page": "E",
      "title": "Edges of a graph",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "E"
      ]
    },
    {
      "page": "each_edge",
      "title": "Rewires the endpoints of the edges of a graph to a random vertex",
      "concept": [
        "rewiring functions"
      ],
      "topics": [
        "each_edge"
      ]
    },
    {
      "page": "eccentricity",
      "title": "Eccentricity of the vertices in a graph",
      "concept": [
        "paths"
      ],
      "topics": [
        "eccentricity"
      ]
    },
    {
      "page": "edge",
      "title": "Helper function for adding and deleting edges",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "edge",
        "edges"
      ]
    },
    {
      "page": "edge_attr",
      "title": "Query edge attributes of a graph",
      "concept": [
        "attributes"
      ],
      "topics": [
        "edge.attributes",
        "edge_attr"
      ]
    },
    {
      "page": "edge_attr_names",
      "title": "List names of edge attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "edge_attr_names"
      ]
    },
    {
      "page": "edge_attr-set",
      "title": "Set one or more edge attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "edge.attributes<-",
        "edge_attr<-"
      ]
    },
    {
      "page": "edge_connectivity",
      "title": "Edge connectivity",
      "concept": [
        "flow"
      ],
      "topics": [
        "adhesion",
        "edge_connectivity",
        "edge_disjoint_paths"
      ]
    },
    {
      "page": "edge_density",
      "title": "Graph density",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "edge_density"
      ]
    },
    {
      "page": "eigen_centrality",
      "title": "Eigenvector centrality of vertices",
      "concept": [
        "centrality"
      ],
      "topics": [
        "eigen_centrality"
      ]
    },
    {
      "page": "embed_adjacency_matrix",
      "title": "Spectral Embedding of Adjacency Matrices",
      "concept": [
        "embedding"
      ],
      "topics": [
        "embed_adjacency_matrix"
      ]
    },
    {
      "page": "embed_laplacian_matrix",
      "title": "Spectral Embedding of the Laplacian of a Graph",
      "concept": [
        "embedding"
      ],
      "topics": [
        "embed_laplacian_matrix"
      ]
    },
    {
      "page": "ends",
      "title": "Incident vertices of some graph edges",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "ends",
        "get.edges"
      ]
    },
    {
      "page": "feedback_arc_set",
      "title": "Finding a feedback arc set in a graph",
      "concept": [
        "cycles",
        "structural.properties"
      ],
      "topics": [
        "feedback_arc_set"
      ]
    },
    {
      "page": "feedback_vertex_set",
      "title": "Finding a feedback vertex set in a graph",
      "concept": [
        "cycles",
        "structural.properties"
      ],
      "topics": [
        "feedback_vertex_set"
      ]
    },
    {
      "page": "find_cycle",
      "title": "Finds a cycle in a graph, if there is one",
      "concept": [
        "cycles"
      ],
      "topics": [
        "find_cycle"
      ]
    },
    {
      "page": "fit_hrg",
      "title": "Fit a hierarchical random graph model",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "fit_hrg"
      ]
    },
    {
      "page": "fit_power_law",
      "title": "Fitting a power-law distribution function to discrete data",
      "concept": [
        "fit"
      ],
      "topics": [
        "fit_power_law"
      ]
    },
    {
      "page": "get_edge_ids",
      "title": "Find the edge ids based on the incident vertices of the edges",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "get_edge_ids"
      ]
    },
    {
      "page": "girth",
      "title": "Girth of a graph",
      "concept": [
        "cycles",
        "structural.properties"
      ],
      "topics": [
        "girth"
      ]
    },
    {
      "page": "global_efficiency",
      "title": "Efficiency of a graph",
      "concept": [
        "efficiency"
      ],
      "topics": [
        "average_local_efficiency",
        "global_efficiency",
        "local_efficiency"
      ]
    },
    {
      "page": "gorder",
      "title": "Order (number of vertices) of a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "gorder",
        "vcount"
      ]
    },
    {
      "page": "graph_",
      "title": "Convert object to a graph",
      "topics": [
        "graph_"
      ]
    },
    {
      "page": "graph_attr",
      "title": "Graph attributes of a graph",
      "concept": [
        "attributes"
      ],
      "topics": [
        "graph.attributes",
        "graph_attr"
      ]
    },
    {
      "page": "graph_attr_names",
      "title": "List names of graph attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "attributes",
        "graph_attr_names"
      ]
    },
    {
      "page": "graph_attr-set",
      "title": "Set all or some graph attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "graph.attributes<-",
        "graph_attr<-"
      ]
    },
    {
      "page": "graph_center",
      "title": "Central vertices of a graph",
      "concept": [
        "paths"
      ],
      "topics": [
        "graph_center"
      ]
    },
    {
      "page": "graph_from_adj_list",
      "title": "Create graphs from adjacency lists",
      "concept": [
        "conversion"
      ],
      "topics": [
        "graph_from_adj_list"
      ]
    },
    {
      "page": "graph_from_adjacency_matrix",
      "title": "Create graphs from adjacency matrices",
      "concept": [
        "adjacency"
      ],
      "topics": [
        "from_adjacency",
        "graph_from_adjacency_matrix"
      ]
    },
    {
      "page": "graph_from_atlas",
      "title": "Create a graph from the Graph Atlas",
      "concept": [
        "Graph Atlas.",
        "deterministic constructors"
      ],
      "topics": [
        "atlas",
        "graph_from_atlas"
      ]
    },
    {
      "page": "graph_from_biadjacency_matrix",
      "title": "Create graphs from a bipartite adjacency matrix",
      "concept": [
        "biadjacency"
      ],
      "topics": [
        "graph_from_biadjacency_matrix"
      ]
    },
    {
      "page": "graph_from_edgelist",
      "title": "Create a graph from an edge list matrix",
      "concept": [
        "Edge list",
        "deterministic constructors"
      ],
      "topics": [
        "from_edgelist",
        "graph_from_edgelist"
      ]
    },
    {
      "page": "graph_from_graphdb",
      "title": "Load a graph from the graph database for testing graph isomorphism.",
      "concept": [
        "foreign"
      ],
      "topics": [
        "graph_from_graphdb"
      ]
    },
    {
      "page": "graph_from_graphnel",
      "title": "Convert graphNEL objects from the graph package to igraph",
      "concept": [
        "conversion"
      ],
      "topics": [
        "graph_from_graphnel"
      ]
    },
    {
      "page": "graph_from_isomorphism_class",
      "title": "Create a graph from an isomorphism class",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph_from_isomorphism_class"
      ]
    },
    {
      "page": "graph_from_lcf",
      "title": "Creating a graph from LCF notation",
      "topics": [
        "graph_from_lcf"
      ]
    },
    {
      "page": "graph_from_literal",
      "title": "Creating (small) graphs via a simple interface",
      "concept": [
        "deterministic constructors"
      ],
      "topics": [
        "from_literal",
        "graph_from_literal"
      ]
    },
    {
      "page": "graph_id",
      "title": "Get the id of a graph",
      "topics": [
        "graph_id"
      ]
    },
    {
      "page": "graph_version",
      "title": "igraph data structure versions",
      "concept": [
        "versions"
      ],
      "topics": [
        "graph_version"
      ]
    },
    {
      "page": "graphlet_basis",
      "title": "Graphlet decomposition of a graph",
      "concept": [
        "glet"
      ],
      "topics": [
        "graphlets",
        "graphlet_basis",
        "graphlet_proj"
      ]
    },
    {
      "page": "greedy_vertex_coloring",
      "title": "Greedy vertex coloring",
      "concept": [
        "coloring"
      ],
      "topics": [
        "greedy_vertex_coloring"
      ]
    },
    {
      "page": "groups",
      "title": "Groups of a vertex partitioning",
      "concept": [
        "community"
      ],
      "topics": [
        "groups",
        "groups.communities",
        "groups.default"
      ]
    },
    {
      "page": "gsize",
      "title": "The size of the graph (number of edges)",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "ecount",
        "gsize"
      ]
    },
    {
      "page": "harmonic_centrality",
      "title": "Harmonic centrality of vertices",
      "concept": [
        "centrality"
      ],
      "topics": [
        "harmonic_centrality"
      ]
    },
    {
      "page": "has_eulerian_path",
      "title": "Find Eulerian paths or cycles in a graph",
      "concept": [
        "cycles"
      ],
      "topics": [
        "eulerian_cycle",
        "eulerian_path",
        "has_eulerian_cycle",
        "has_eulerian_path"
      ]
    },
    {
      "page": "head_of",
      "title": "Head of the edge(s) in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "head_of"
      ]
    },
    {
      "page": "head_print",
      "title": "Print the only the head of an R object",
      "topics": [
        "head_print"
      ]
    },
    {
      "page": "hits_scores",
      "title": "Kleinberg's hub and authority centrality scores.",
      "concept": [
        "centrality"
      ],
      "topics": [
        "hits_scores"
      ]
    },
    {
      "page": "hrg",
      "title": "Create a hierarchical random graph from an igraph graph",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "hrg"
      ]
    },
    {
      "page": "hrg_tree",
      "title": "Create an igraph graph from a hierarchical random graph model",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "hrg_tree"
      ]
    },
    {
      "page": "hrg-methods",
      "title": "Hierarchical random graphs",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "hrg-methods"
      ]
    },
    {
      "page": "identical_graphs",
      "title": "Decide if two graphs are identical",
      "topics": [
        "identical_graphs"
      ]
    },
    {
      "page": "igraph_options",
      "title": "Parameters for the igraph package",
      "concept": [
        "igraph options"
      ],
      "topics": [
        "igraph_opt",
        "igraph_options"
      ]
    },
    {
      "page": "igraph-attribute-combination",
      "title": "How igraph functions handle attributes when the graph changes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "attribute.combination",
        "igraph-attribute-combination"
      ]
    },
    {
      "page": "igraph-dollar",
      "title": "Getting and setting graph attributes, shortcut",
      "concept": [
        "attributes"
      ],
      "topics": [
        "$.igraph",
        "$<-.igraph",
        "igraph-dollar"
      ]
    },
    {
      "page": "igraph-es-attributes",
      "title": "Query or set attributes of the edges in an edge sequence",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "$.igraph.es",
        "$<-.igraph.es",
        "E<-",
        "igraph-es-attributes",
        "[<-.igraph.es",
        "[[<-.igraph.es"
      ]
    },
    {
      "page": "igraph-es-indexing",
      "title": "Indexing edge sequences",
      "concept": [
        "vertex and edge sequence operations",
        "vertex and edge sequences"
      ],
      "topics": [
        "%--%",
        "%->%",
        "%<-%",
        "igraph-es-indexing",
        "[.igraph.es"
      ]
    },
    {
      "page": "igraph-es-indexing2",
      "title": "Select edges and show their metadata",
      "concept": [
        "vertex and edge sequence operations",
        "vertex and edge sequences"
      ],
      "topics": [
        "igraph-es-indexing2",
        "[[.igraph.es"
      ]
    },
    {
      "page": "igraph-minus",
      "title": "Delete vertices or edges from a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "-.igraph",
        "igraph-minus"
      ]
    },
    {
      "page": "igraph-vs-attributes",
      "title": "Query or set attributes of the vertices in a vertex sequence",
      "concept": [
        "attributes",
        "vertex and edge sequences"
      ],
      "topics": [
        "$.igraph.vs",
        "$<-.igraph.vs",
        "igraph-vs-attributes",
        "V<-",
        "[<-.igraph.vs",
        "[[<-.igraph.vs"
      ]
    },
    {
      "page": "igraph-vs-indexing",
      "title": "Indexing vertex sequences",
      "concept": [
        "vertex and edge sequence operations",
        "vertex and edge sequences"
      ],
      "topics": [
        "igraph-vs-indexing",
        "[.igraph.vs"
      ]
    },
    {
      "page": "igraph-vs-indexing2",
      "title": "Select vertices and show their metadata",
      "concept": [
        "vertex and edge sequence operations",
        "vertex and edge sequences"
      ],
      "topics": [
        "igraph-vs-indexing2",
        "[[.igraph.vs"
      ]
    },
    {
      "page": "incident",
      "title": "Incident edges of a vertex in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "incident"
      ]
    },
    {
      "page": "incident_edges",
      "title": "Incident edges of multiple vertices in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "incident_edges"
      ]
    },
    {
      "page": "indent_print",
      "title": "Indent a printout",
      "topics": [
        "indent_print"
      ]
    },
    {
      "page": "intersection",
      "title": "Intersection of two or more sets",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "intersection"
      ]
    },
    {
      "page": "intersection.igraph",
      "title": "Intersection of graphs",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "%s%",
        "intersection.igraph"
      ]
    },
    {
      "page": "intersection.igraph.es",
      "title": "Intersection of edge sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "intersection.igraph.es"
      ]
    },
    {
      "page": "intersection.igraph.vs",
      "title": "Intersection of vertex sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "intersection.igraph.vs"
      ]
    },
    {
      "page": "is_acyclic",
      "title": "Acyclic graphs",
      "concept": [
        "cycles",
        "structural.properties"
      ],
      "topics": [
        "is_acyclic"
      ]
    },
    {
      "page": "is_biconnected",
      "title": "Check biconnectedness",
      "concept": [
        "components"
      ],
      "topics": [
        "is_biconnected"
      ]
    },
    {
      "page": "is_bipartite",
      "title": "Checks whether the graph has a vertex attribute called 'type'.",
      "concept": [
        "bipartite"
      ],
      "topics": [
        "is_bipartite"
      ]
    },
    {
      "page": "is_chordal",
      "title": "Chordality of a graph",
      "concept": [
        "chordal"
      ],
      "topics": [
        "is_chordal"
      ]
    },
    {
      "page": "is_complete",
      "title": "Is this a complete graph?",
      "concept": [
        "cliques"
      ],
      "topics": [
        "is_complete"
      ]
    },
    {
      "page": "is_dag",
      "title": "Directed acyclic graphs",
      "concept": [
        "cycles",
        "structural.properties"
      ],
      "topics": [
        "is_dag"
      ]
    },
    {
      "page": "is_degseq",
      "title": "Check if a degree sequence is valid for a multi-graph",
      "concept": [
        "graphical degree sequences"
      ],
      "topics": [
        "is_degseq"
      ]
    },
    {
      "page": "is_directed",
      "title": "Check whether a graph is directed",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "is_directed"
      ]
    },
    {
      "page": "is_forest",
      "title": "Decide whether a graph is a forest.",
      "concept": [
        "trees"
      ],
      "topics": [
        "is_forest"
      ]
    },
    {
      "page": "is_graphical",
      "title": "Is a degree sequence graphical?",
      "concept": [
        "graphical degree sequences"
      ],
      "topics": [
        "is_graphical"
      ]
    },
    {
      "page": "is_igraph",
      "title": "Is this object an igraph graph?",
      "topics": [
        "is_igraph"
      ]
    },
    {
      "page": "matching",
      "title": "Matching",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "is_matching",
        "is_max_matching",
        "max_bipartite_match"
      ]
    },
    {
      "page": "is_min_separator",
      "title": "Minimal vertex separators",
      "concept": [
        "flow"
      ],
      "topics": [
        "is_min_separator"
      ]
    },
    {
      "page": "is_named",
      "title": "Named graphs",
      "topics": [
        "is_named"
      ]
    },
    {
      "page": "is_printer_callback",
      "title": "Is this a printer callback?",
      "concept": [
        "printer callbacks"
      ],
      "topics": [
        "is_printer_callback"
      ]
    },
    {
      "page": "is_separator",
      "title": "Check whether removing this set of vertices would disconnect the graph.",
      "concept": [
        "flow"
      ],
      "topics": [
        "is_separator"
      ]
    },
    {
      "page": "is_tree",
      "title": "Decide whether a graph is a tree.",
      "concept": [
        "trees"
      ],
      "topics": [
        "is_tree"
      ]
    },
    {
      "page": "is_weighted",
      "title": "Weighted graphs",
      "topics": [
        "is_weighted"
      ]
    },
    {
      "page": "isomorphic",
      "title": "Decide if two graphs are isomorphic",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph.isomorphic",
        "graph.isomorphic.34",
        "graph.isomorphic.bliss",
        "graph.isomorphic.vf2",
        "isomorphic",
        "is_isomorphic_to"
      ]
    },
    {
      "page": "isomorphism_class",
      "title": "Isomorphism class of a graph",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph.isoclass",
        "graph.isoclass.subgraph",
        "isomorphism_class"
      ]
    },
    {
      "page": "isomorphisms",
      "title": "Calculate all isomorphic mappings between the vertices of two graphs",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph.get.isomorphisms.vf2",
        "isomorphisms"
      ]
    },
    {
      "page": "ivs",
      "title": "Independent vertex sets",
      "concept": [
        "cliques"
      ],
      "topics": [
        "independence_number",
        "is_ivs",
        "ivs",
        "ivs_size",
        "largest_ivs",
        "max_ivs"
      ]
    },
    {
      "page": "k_shortest_paths",
      "title": "Find the k shortest paths between two vertices",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "k_shortest_paths"
      ]
    },
    {
      "page": "keeping_degseq",
      "title": "Graph rewiring while preserving the degree distribution",
      "concept": [
        "rewiring functions"
      ],
      "topics": [
        "keeping_degseq"
      ]
    },
    {
      "page": "knn",
      "title": "Average nearest neighbor degree",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "knn"
      ]
    },
    {
      "page": "laplacian_matrix",
      "title": "Graph Laplacian",
      "topics": [
        "laplacian_matrix"
      ]
    },
    {
      "page": "layout_",
      "title": "Graph layouts",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout",
        "layout_",
        "print.igraph_layout_modifier",
        "print.igraph_layout_spec"
      ]
    },
    {
      "page": "layout_as_bipartite",
      "title": "Simple two-row layout for bipartite graphs",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "as_bipartite",
        "layout_as_bipartite"
      ]
    },
    {
      "page": "layout_as_star",
      "title": "Generate coordinates to place the vertices of a graph in a star-shape",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "as_star",
        "layout_as_star"
      ]
    },
    {
      "page": "layout_as_tree",
      "title": "The Reingold-Tilford graph layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "as_tree",
        "layout_as_tree"
      ]
    },
    {
      "page": "layout_in_circle",
      "title": "Graph layout with vertices on a circle.",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "in_circle",
        "layout_in_circle"
      ]
    },
    {
      "page": "layout_nicely",
      "title": "Choose an appropriate graph layout algorithm automatically",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_nicely",
        "nicely"
      ]
    },
    {
      "page": "layout_on_grid",
      "title": "Simple grid layout",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_on_grid",
        "on_grid"
      ]
    },
    {
      "page": "layout_on_sphere",
      "title": "Graph layout with vertices on the surface of a sphere",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_on_sphere",
        "on_sphere"
      ]
    },
    {
      "page": "layout_randomly",
      "title": "Randomly place vertices on a plane or in 3d space",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_randomly",
        "randomly"
      ]
    },
    {
      "page": "layout_with_dh",
      "title": "The Davidson-Harel layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_dh",
        "with_dh"
      ]
    },
    {
      "page": "layout_with_drl",
      "title": "The DrL graph layout generator",
      "concept": [
        "layout_drl"
      ],
      "topics": [
        "drl_defaults",
        "igraph.drl.coarsen",
        "igraph.drl.coarsest",
        "igraph.drl.default",
        "igraph.drl.final",
        "igraph.drl.refine",
        "layout_with_drl",
        "with_drl"
      ]
    },
    {
      "page": "layout_with_fr",
      "title": "The Fruchterman-Reingold layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_fr",
        "with_fr"
      ]
    },
    {
      "page": "layout_with_gem",
      "title": "The GEM layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_gem",
        "with_gem"
      ]
    },
    {
      "page": "layout_with_graphopt",
      "title": "The graphopt layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_graphopt",
        "with_graphopt"
      ]
    },
    {
      "page": "layout_with_kk",
      "title": "The Kamada-Kawai layout algorithm",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_kk",
        "with_kk"
      ]
    },
    {
      "page": "layout_with_lgl",
      "title": "Large Graph Layout",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_lgl",
        "with_lgl"
      ]
    },
    {
      "page": "layout_with_mds",
      "title": "Graph layout by multidimensional scaling",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_mds",
        "with_mds"
      ]
    },
    {
      "page": "layout_with_sugiyama",
      "title": "The Sugiyama graph layout generator",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_with_sugiyama",
        "with_sugiyama"
      ]
    },
    {
      "page": "local_scan",
      "title": "Compute local scan statistics on graphs",
      "concept": [
        "scan statistics"
      ],
      "topics": [
        "local_scan"
      ]
    },
    {
      "page": "make_",
      "title": "Make a new graph",
      "concept": [
        "constructor modifiers",
        "deterministic constructors"
      ],
      "topics": [
        "make_"
      ]
    },
    {
      "page": "make_bipartite_graph",
      "title": "Create a bipartite graph",
      "concept": [
        "bipartite"
      ],
      "topics": [
        "bipartite_graph",
        "make_bipartite_graph"
      ]
    },
    {
      "page": "make_chordal_ring",
      "title": "Create an extended chordal ring graph",
      "concept": [
        "deterministic constructors"
      ],
      "topics": [
        "chordal_ring",
        "make_chordal_ring"
      ]
    },
    {
      "page": "make_clusters",
      "title": "Creates a communities object.",
      "concept": [
        "community"
      ],
      "topics": [
        "make_clusters"
      ]
    },
    {
      "page": "make_de_bruijn_graph",
      "title": "De Bruijn graphs",
      "topics": [
        "de_bruijn_graph",
        "make_de_bruijn_graph"
      ]
    },
    {
      "page": "make_empty_graph",
      "title": "A graph with no edges",
      "concept": [
        "Empty graph.",
        "deterministic constructors"
      ],
      "topics": [
        "empty_graph",
        "make_empty_graph"
      ]
    },
    {
      "page": "make_from_prufer",
      "title": "Create an undirected tree graph from its Prüfer sequence",
      "concept": [
        "trees"
      ],
      "topics": [
        "from_prufer",
        "make_from_prufer"
      ]
    },
    {
      "page": "make_full_bipartite_graph",
      "title": "Create a full bipartite graph",
      "topics": [
        "full_bipartite_graph",
        "make_full_bipartite_graph"
      ]
    },
    {
      "page": "make_full_citation_graph",
      "title": "Create a complete (full) citation graph",
      "concept": [
        "deterministic constructors"
      ],
      "topics": [
        "full_citation_graph",
        "make_full_citation_graph"
      ]
    },
    {
      "page": "make_full_graph",
      "title": "Create a full graph",
      "concept": [
        "Full graph",
        "deterministic constructors"
      ],
      "topics": [
        "full_graph",
        "make_full_graph"
      ]
    },
    {
      "page": "make_graph",
      "title": "Create an igraph graph from a list of edges, or a notable graph",
      "concept": [
        "deterministic constructors"
      ],
      "topics": [
        "directed_graph",
        "make_directed_graph",
        "make_graph",
        "make_undirected_graph",
        "undirected_graph"
      ]
    },
    {
      "page": "make_kautz_graph",
      "title": "Kautz graphs",
      "topics": [
        "kautz_graph",
        "make_kautz_graph"
      ]
    },
    {
      "page": "make_lattice",
      "title": "Create a lattice graph",
      "concept": [
        "Lattice",
        "deterministic constructors"
      ],
      "topics": [
        "lattice",
        "make_lattice"
      ]
    },
    {
      "page": "make_line_graph",
      "title": "Line graph of a graph",
      "topics": [
        "line_graph",
        "make_line_graph"
      ]
    },
    {
      "page": "make_ring",
      "title": "Create a ring graph",
      "concept": [
        "deterministic constructors"
      ],
      "topics": [
        "make_ring",
        "ring"
      ]
    },
    {
      "page": "make_star",
      "title": "Create a star graph, a tree with n vertices and n - 1 leaves",
      "concept": [
        "Star graph",
        "deterministic constructors"
      ],
      "topics": [
        "make_star",
        "star"
      ]
    },
    {
      "page": "make_tree",
      "title": "Create tree graphs",
      "concept": [
        "Trees.",
        "deterministic constructors"
      ],
      "topics": [
        "make_tree",
        "tree"
      ]
    },
    {
      "page": "match_vertices",
      "title": "Match Graphs given a seeding of vertex correspondences",
      "concept": [
        "sgm"
      ],
      "topics": [
        "match_vertices",
        "seeded.graph.match"
      ]
    },
    {
      "page": "max_cardinality",
      "title": "Maximum cardinality search",
      "concept": [
        "chordal"
      ],
      "topics": [
        "max_cardinality"
      ]
    },
    {
      "page": "max_flow",
      "title": "Maximum flow in a graph",
      "concept": [
        "flow"
      ],
      "topics": [
        "max_flow"
      ]
    },
    {
      "page": "communities",
      "title": "Functions to deal with the result of network community detection",
      "concept": [
        "community"
      ],
      "topics": [
        "algorithm",
        "as.dendrogram.communities",
        "as.hclust.communities",
        "code_len",
        "communities",
        "crossing",
        "cut_at",
        "is_hierarchical",
        "length.communities",
        "membership",
        "merges",
        "modularity.communities",
        "plot.communities",
        "print.communities",
        "show_trace",
        "sizes"
      ]
    },
    {
      "page": "merge_coords",
      "title": "Merging graph layouts",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "layout_components",
        "merge_coords"
      ]
    },
    {
      "page": "min_cut",
      "title": "Minimum cut in a graph",
      "concept": [
        "flow"
      ],
      "topics": [
        "min_cut"
      ]
    },
    {
      "page": "min_separators",
      "title": "Minimum size vertex separators",
      "concept": [
        "flow"
      ],
      "topics": [
        "min_separators"
      ]
    },
    {
      "page": "min_st_separators",
      "title": "Minimum size vertex separators",
      "concept": [
        "flow"
      ],
      "topics": [
        "min_st_separators"
      ]
    },
    {
      "page": "modularity.igraph",
      "title": "Modularity of a community structure of a graph",
      "concept": [
        "community"
      ],
      "topics": [
        "modularity",
        "modularity.igraph",
        "modularity_matrix"
      ]
    },
    {
      "page": "motifs",
      "title": "Graph motifs",
      "concept": [
        "graph motifs"
      ],
      "topics": [
        "motifs"
      ]
    },
    {
      "page": "mst",
      "title": "Minimum spanning tree",
      "concept": [
        "minimum.spanning.tree"
      ],
      "topics": [
        "mst"
      ]
    },
    {
      "page": "neighbors",
      "title": "Neighboring (adjacent) vertices in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "neighbors"
      ]
    },
    {
      "page": "norm_coords",
      "title": "Normalize coordinates for plotting graphs",
      "concept": [
        "graph layouts"
      ],
      "topics": [
        "norm_coords"
      ]
    },
    {
      "page": "normalize",
      "title": "Normalize layout",
      "concept": [
        "graph layouts",
        "layout modifiers"
      ],
      "topics": [
        "normalize"
      ]
    },
    {
      "page": "page_rank",
      "title": "The Page Rank algorithm",
      "concept": [
        "centrality"
      ],
      "topics": [
        "page_rank"
      ]
    },
    {
      "page": "path",
      "title": "Helper function to add or delete edges along a path",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "path"
      ]
    },
    {
      "page": "permute",
      "title": "Permute the vertices of a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "permute"
      ]
    },
    {
      "page": "plot_dendrogram.communities",
      "title": "Community structure dendrogram plots",
      "concept": [
        "community"
      ],
      "topics": [
        "plot_dendrogram",
        "plot_dendrogram.communities"
      ]
    },
    {
      "page": "plot_dendrogram.igraphHRG",
      "title": "HRG dendrogram plot",
      "topics": [
        "plot_dendrogram.igraphHRG"
      ]
    },
    {
      "page": "plot.common",
      "title": "Drawing graphs",
      "topics": [
        "igraph.plotting",
        "plot.common"
      ]
    },
    {
      "page": "plot.igraph",
      "title": "Plotting of graphs",
      "concept": [
        "plot"
      ],
      "topics": [
        "plot.graph",
        "plot.igraph"
      ]
    },
    {
      "page": "plot.sir",
      "title": "Plotting the results on multiple SIR model runs",
      "concept": [
        "processes"
      ],
      "topics": [
        "plot.sir"
      ]
    },
    {
      "page": "power_centrality",
      "title": "Find Bonacich Power Centrality Scores of Network Positions",
      "concept": [
        "centrality"
      ],
      "topics": [
        "power_centrality"
      ]
    },
    {
      "page": "predict_edges",
      "title": "Predict edges based on a hierarchical random graph model",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "predict_edges"
      ]
    },
    {
      "page": "print.igraph",
      "title": "Print graphs to the terminal",
      "concept": [
        "print"
      ],
      "topics": [
        "print.igraph",
        "print_all",
        "str.igraph",
        "summary.igraph"
      ]
    },
    {
      "page": "print.igraph.es",
      "title": "Print an edge sequence to the screen",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "print.igraph.es"
      ]
    },
    {
      "page": "print.igraph.vs",
      "title": "Show a vertex sequence on the screen",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "print.igraph.vs"
      ]
    },
    {
      "page": "print.igraphHRG",
      "title": "Print a hierarchical random graph model to the screen",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "print.igraphHRG"
      ]
    },
    {
      "page": "print.igraphHRGConsensus",
      "title": "Print a hierarchical random graph consensus tree to the screen",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "print.igraphHRGConsensus"
      ]
    },
    {
      "page": "printer_callback",
      "title": "Create a printer callback function",
      "concept": [
        "printer callbacks"
      ],
      "topics": [
        "printer_callback"
      ]
    },
    {
      "page": "r_pal",
      "title": "The default R palette",
      "concept": [
        "palettes"
      ],
      "topics": [
        "r_pal"
      ]
    },
    {
      "page": "radius",
      "title": "Radius of a graph",
      "concept": [
        "paths"
      ],
      "topics": [
        "radius"
      ]
    },
    {
      "page": "random_walk",
      "title": "Random walk on a graph",
      "concept": [
        "random_walk"
      ],
      "topics": [
        "random_edge_walk",
        "random_walk"
      ]
    },
    {
      "page": "read_graph",
      "title": "Reading foreign file formats",
      "concept": [
        "foreign"
      ],
      "topics": [
        "DL",
        "GML",
        "GraphML",
        "LGL",
        "Pajek",
        "read_graph",
        "UCINET"
      ]
    },
    {
      "page": "realize_bipartite_degseq",
      "title": "Creating a bipartite graph from two degree sequences, deterministically",
      "topics": [
        "realize_bipartite_degseq"
      ]
    },
    {
      "page": "realize_degseq",
      "title": "Creating a graph from a given degree sequence, deterministically",
      "topics": [
        "realize_degseq"
      ]
    },
    {
      "page": "reciprocity",
      "title": "Reciprocity of graphs",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "reciprocity"
      ]
    },
    {
      "page": "rep.igraph",
      "title": "Replicate a graph multiple times",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "*.igraph",
        "rep.igraph"
      ]
    },
    {
      "page": "rev.igraph.es",
      "title": "Reverse the order in an edge sequence",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "rev.igraph.es"
      ]
    },
    {
      "page": "rev.igraph.vs",
      "title": "Reverse the order in a vertex sequence",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "rev.igraph.vs"
      ]
    },
    {
      "page": "reverse_edges",
      "title": "Reverse edges in a graph",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "reverse_edges",
        "t.igraph"
      ]
    },
    {
      "page": "rewire",
      "title": "Rewiring edges of a graph",
      "concept": [
        "rewiring functions"
      ],
      "topics": [
        "rewire"
      ]
    },
    {
      "page": "rglplot",
      "title": "3D plotting of graphs with OpenGL",
      "concept": [
        "plot"
      ],
      "topics": [
        "rglplot",
        "rglplot.igraph"
      ]
    },
    {
      "page": "running_mean",
      "title": "Running mean of a time series",
      "concept": [
        "other"
      ],
      "topics": [
        "running_mean"
      ]
    },
    {
      "page": "sample_",
      "title": "Sample from a random graph model",
      "concept": [
        "constructor modifiers",
        "games"
      ],
      "topics": [
        "sample_"
      ]
    },
    {
      "page": "sample_bipartite",
      "title": "Bipartite random graphs",
      "concept": [
        "games"
      ],
      "topics": [
        "bipartite",
        "sample_bipartite"
      ]
    },
    {
      "page": "sample_chung_lu",
      "title": "Random graph with given expected degrees",
      "concept": [
        "games"
      ],
      "topics": [
        "chung_lu",
        "sample_chung_lu"
      ]
    },
    {
      "page": "sample_correlated_gnp",
      "title": "Generate a new random graph from a given graph by randomly adding/removing edges",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_correlated_gnp"
      ]
    },
    {
      "page": "sample_correlated_gnp_pair",
      "title": "Sample a pair of correlated G(n,p) random graphs",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_correlated_gnp_pair"
      ]
    },
    {
      "page": "sample_degseq",
      "title": "Generate random graphs with a given degree sequence",
      "concept": [
        "games"
      ],
      "topics": [
        "degseq",
        "sample_degseq"
      ]
    },
    {
      "page": "sample_dirichlet",
      "title": "Sample from a Dirichlet distribution",
      "concept": [
        "latent position vector samplers"
      ],
      "topics": [
        "sample_dirichlet"
      ]
    },
    {
      "page": "sample_dot_product",
      "title": "Generate random graphs according to the random dot product graph model",
      "concept": [
        "games"
      ],
      "topics": [
        "dot_product",
        "sample_dot_product"
      ]
    },
    {
      "page": "sample_fitness",
      "title": "Random graphs from vertex fitness scores",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_fitness"
      ]
    },
    {
      "page": "sample_fitness_pl",
      "title": "Scale-free random graphs, from vertex fitness scores",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_fitness_pl"
      ]
    },
    {
      "page": "sample_forestfire",
      "title": "Forest Fire Network Model",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_forestfire"
      ]
    },
    {
      "page": "sample_gnm",
      "title": "Generate random graphs according to the G(n,m) Erdős-Rényi model",
      "concept": [
        "games"
      ],
      "topics": [
        "gnm",
        "sample_gnm"
      ]
    },
    {
      "page": "sample_gnp",
      "title": "Generate random graphs according to the G(n,p) Erdős-Rényi model",
      "concept": [
        "games"
      ],
      "topics": [
        "gnp",
        "sample_gnp"
      ]
    },
    {
      "page": "sample_grg",
      "title": "Geometric random graphs",
      "concept": [
        "games"
      ],
      "topics": [
        "grg",
        "sample_grg"
      ]
    },
    {
      "page": "sample_growing",
      "title": "Growing random graph generation",
      "concept": [
        "games"
      ],
      "topics": [
        "growing",
        "sample_growing"
      ]
    },
    {
      "page": "sample_hierarchical_sbm",
      "title": "Sample the hierarchical stochastic block model",
      "concept": [
        "games"
      ],
      "topics": [
        "hierarchical_sbm",
        "sample_hierarchical_sbm"
      ]
    },
    {
      "page": "sample_hrg",
      "title": "Sample from a hierarchical random graph model",
      "concept": [
        "hierarchical random graph functions"
      ],
      "topics": [
        "sample_hrg"
      ]
    },
    {
      "page": "sample_islands",
      "title": "A graph with subgraphs that are each a random graph.",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_islands"
      ]
    },
    {
      "page": "sample_k_regular",
      "title": "Create a random regular graph",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_k_regular"
      ]
    },
    {
      "page": "sample_last_cit",
      "title": "Random citation graphs",
      "concept": [
        "games"
      ],
      "topics": [
        "cit_cit_types",
        "cit_types",
        "last_cit",
        "sample_cit_cit_types",
        "sample_cit_types",
        "sample_last_cit"
      ]
    },
    {
      "page": "sample_motifs",
      "title": "Graph motifs",
      "concept": [
        "graph motifs"
      ],
      "topics": [
        "sample_motifs"
      ]
    },
    {
      "page": "sample_pa",
      "title": "Generate random graphs using preferential attachment",
      "concept": [
        "games"
      ],
      "topics": [
        "pa",
        "sample_pa"
      ]
    },
    {
      "page": "sample_pa_age",
      "title": "Generate an evolving random graph with preferential attachment and aging",
      "concept": [
        "games"
      ],
      "topics": [
        "pa_age",
        "sample_pa_age"
      ]
    },
    {
      "page": "sample_pref",
      "title": "Trait-based random generation",
      "concept": [
        "games"
      ],
      "topics": [
        "asym_pref",
        "pref",
        "sample_asym_pref",
        "sample_pref"
      ]
    },
    {
      "page": "sample_sbm",
      "title": "Sample stochastic block model",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_sbm",
        "sbm"
      ]
    },
    {
      "page": "sample_seq",
      "title": "Sampling a random integer sequence",
      "concept": [
        "other"
      ],
      "topics": [
        "sample_seq"
      ]
    },
    {
      "page": "sample_smallworld",
      "title": "The Watts-Strogatz small-world model",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_smallworld",
        "smallworld"
      ]
    },
    {
      "page": "sample_spanning_tree",
      "title": "Samples from the spanning trees of a graph randomly and uniformly",
      "concept": [
        "trees"
      ],
      "topics": [
        "sample_spanning_tree"
      ]
    },
    {
      "page": "sample_sphere_surface",
      "title": "Sample vectors uniformly from the surface of a sphere",
      "concept": [
        "latent position vector samplers"
      ],
      "topics": [
        "sample_sphere_surface"
      ]
    },
    {
      "page": "sample_sphere_volume",
      "title": "Sample vectors uniformly from the volume of a sphere",
      "concept": [
        "latent position vector samplers"
      ],
      "topics": [
        "sample_sphere_volume"
      ]
    },
    {
      "page": "sample_traits_callaway",
      "title": "Graph generation based on different vertex types",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_traits",
        "sample_traits_callaway",
        "traits",
        "traits_callaway"
      ]
    },
    {
      "page": "sample_tree",
      "title": "Sample trees randomly and uniformly",
      "concept": [
        "games"
      ],
      "topics": [
        "sample_tree"
      ]
    },
    {
      "page": "scan_stat",
      "title": "Scan statistics on a time series of graphs",
      "concept": [
        "scan statistics"
      ],
      "topics": [
        "scan_stat"
      ]
    },
    {
      "page": "sequential_pal",
      "title": "Sequential palette",
      "concept": [
        "palettes"
      ],
      "topics": [
        "sequential_pal"
      ]
    },
    {
      "page": "set_edge_attr",
      "title": "Set edge attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "set_edge_attr"
      ]
    },
    {
      "page": "set_graph_attr",
      "title": "Set a graph attribute",
      "concept": [
        "attributes"
      ],
      "topics": [
        "set_graph_attr"
      ]
    },
    {
      "page": "set_vertex_attr",
      "title": "Set vertex attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "set_vertex_attr"
      ]
    },
    {
      "page": "set_vertex_attrs",
      "title": "Set multiple vertex attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "set_vertex_attrs"
      ]
    },
    {
      "page": "shapes",
      "title": "Various vertex shapes when plotting igraph graphs",
      "concept": [
        "plot.shapes"
      ],
      "topics": [
        "add_shape",
        "igraph.vertex.shapes",
        "shapes",
        "shape_noclip",
        "shape_noplot"
      ]
    },
    {
      "page": "similarity",
      "title": "Similarity measures of two vertices",
      "concept": [
        "cocitation",
        "similarity"
      ],
      "topics": [
        "similarity"
      ]
    },
    {
      "page": "simple_cycles",
      "title": "Finds all simple cycles in a graph.",
      "concept": [
        "cycles"
      ],
      "topics": [
        "simple_cycles"
      ]
    },
    {
      "page": "simplified",
      "title": "Constructor modifier to drop multiple and loop edges",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "simplified"
      ]
    },
    {
      "page": "simplify",
      "title": "Simple graphs",
      "concept": [
        "functions for manipulating graph structure",
        "isomorphism",
        "simple"
      ],
      "topics": [
        "is_simple",
        "simplify",
        "simplify_and_colorize"
      ]
    },
    {
      "page": "spectrum",
      "title": "Eigenvalues and eigenvectors of the adjacency matrix of a graph",
      "concept": [
        "centrality"
      ],
      "topics": [
        "igraph.eigen.default",
        "spectrum"
      ]
    },
    {
      "page": "split_join_distance",
      "title": "Split-join distance of two community structures",
      "concept": [
        "community"
      ],
      "topics": [
        "split_join_distance"
      ]
    },
    {
      "page": "st_cuts",
      "title": "List all (s,t)-cuts of a graph",
      "concept": [
        "flow"
      ],
      "topics": [
        "st_cuts"
      ]
    },
    {
      "page": "st_min_cuts",
      "title": "List all minimum (s,t)-cuts of a graph",
      "concept": [
        "flow"
      ],
      "topics": [
        "st_min_cuts"
      ]
    },
    {
      "page": "stochastic_matrix",
      "title": "Stochastic matrix of a graph",
      "topics": [
        "stochastic_matrix"
      ]
    },
    {
      "page": "strength",
      "title": "Strength or weighted vertex degree",
      "concept": [
        "centrality"
      ],
      "topics": [
        "strength"
      ]
    },
    {
      "page": "subcomponent",
      "title": "In- or out- component of a vertex",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "subcomponent"
      ]
    },
    {
      "page": "subgraph",
      "title": "Subgraph of a graph",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "induced_subgraph",
        "subgraph",
        "subgraph_from_edges"
      ]
    },
    {
      "page": "subgraph_centrality",
      "title": "Find subgraph centrality scores of network positions",
      "concept": [
        "centrality"
      ],
      "topics": [
        "subgraph_centrality"
      ]
    },
    {
      "page": "subgraph_isomorphic",
      "title": "Decide if a graph is subgraph isomorphic to another one",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph.subisomorphic.lad",
        "graph.subisomorphic.vf2",
        "is_subgraph_isomorphic_to",
        "subgraph_isomorphic"
      ]
    },
    {
      "page": "subgraph_isomorphisms",
      "title": "All isomorphic mappings between a graph and subgraphs of another graph",
      "concept": [
        "graph isomorphism"
      ],
      "topics": [
        "graph.get.subisomorphisms.vf2",
        "subgraph_isomorphisms"
      ]
    },
    {
      "page": "tail_of",
      "title": "Tails of the edge(s) in a graph",
      "concept": [
        "structural queries"
      ],
      "topics": [
        "tail_of"
      ]
    },
    {
      "page": "sir",
      "title": "SIR model on graphs",
      "concept": [
        "processes"
      ],
      "topics": [
        "median.sir",
        "quantile.sir",
        "sir",
        "time_bins",
        "time_bins.sir"
      ]
    },
    {
      "page": "tkplot",
      "title": "Interactive plotting of graphs",
      "concept": [
        "tkplot"
      ],
      "topics": [
        "tkplot",
        "tk_canvas",
        "tk_center",
        "tk_close",
        "tk_coords",
        "tk_fit",
        "tk_off",
        "tk_postscript",
        "tk_reshape",
        "tk_rotate",
        "tk_set_coords"
      ]
    },
    {
      "page": "to_prufer",
      "title": "Convert a tree graph to its Prüfer sequence",
      "concept": [
        "trees"
      ],
      "topics": [
        "to_prufer"
      ]
    },
    {
      "page": "topo_sort",
      "title": "Topological sorting of vertices in a graph",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "topo_sort"
      ]
    },
    {
      "page": "transitivity",
      "title": "Transitivity of a graph",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "transitivity"
      ]
    },
    {
      "page": "triad_census",
      "title": "Triad census, subgraphs with three vertices",
      "concept": [
        "motifs"
      ],
      "topics": [
        "triad_census"
      ]
    },
    {
      "page": "count_triangles",
      "title": "Find triangles in graphs",
      "concept": [
        "triangles"
      ],
      "topics": [
        "count_triangles",
        "triangles"
      ]
    },
    {
      "page": "unfold_tree",
      "title": "Convert a general graph into a forest",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "unfold_tree"
      ]
    },
    {
      "page": "union",
      "title": "Union of two or more sets",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "union"
      ]
    },
    {
      "page": "union.igraph",
      "title": "Union of graphs",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "%u%",
        "union.igraph"
      ]
    },
    {
      "page": "union.igraph.es",
      "title": "Union of edge sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "union.igraph.es"
      ]
    },
    {
      "page": "union.igraph.vs",
      "title": "Union of vertex sequences",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "union.igraph.vs"
      ]
    },
    {
      "page": "unique.igraph.es",
      "title": "Remove duplicate edges from an edge sequence",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "unique.igraph.es"
      ]
    },
    {
      "page": "unique.igraph.vs",
      "title": "Remove duplicate vertices from a vertex sequence",
      "concept": [
        "vertex and edge sequence operations"
      ],
      "topics": [
        "unique.igraph.vs"
      ]
    },
    {
      "page": "upgrade_graph",
      "title": "igraph data structure versions",
      "concept": [
        "versions"
      ],
      "topics": [
        "upgrade_graph"
      ]
    },
    {
      "page": "V",
      "title": "Vertices of a graph",
      "concept": [
        "vertex and edge sequences"
      ],
      "topics": [
        "V"
      ]
    },
    {
      "page": "vertex",
      "title": "Helper function for adding and deleting vertices",
      "concept": [
        "functions for manipulating graph structure"
      ],
      "topics": [
        "vertex",
        "vertices"
      ]
    },
    {
      "page": "vertex_attr",
      "title": "Query vertex attributes of a graph",
      "concept": [
        "attributes"
      ],
      "topics": [
        "vertex.attributes",
        "vertex_attr"
      ]
    },
    {
      "page": "vertex_attr_names",
      "title": "List names of vertex attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "vertex_attr_names"
      ]
    },
    {
      "page": "vertex_attr-set",
      "title": "Set one or more vertex attributes",
      "concept": [
        "attributes"
      ],
      "topics": [
        "vertex.attributes<-",
        "vertex_attr<-"
      ]
    },
    {
      "page": "vertex_connectivity",
      "title": "Vertex connectivity",
      "concept": [
        "flow"
      ],
      "topics": [
        "cohesion",
        "cohesion.igraph",
        "vertex_connectivity",
        "vertex_disjoint_paths"
      ]
    },
    {
      "page": "vertex.shape.pie",
      "title": "Using pie charts as vertices in graph plots",
      "topics": [
        "vertex.shape.pie"
      ]
    },
    {
      "page": "voronoi_cells",
      "title": "Voronoi partitioning of a graph",
      "concept": [
        "community"
      ],
      "topics": [
        "voronoi_cells"
      ]
    },
    {
      "page": "weighted_cliques",
      "title": "Functions to find weighted cliques, i.e. vertex-weighted complete subgraphs in a graph",
      "concept": [
        "cliques"
      ],
      "topics": [
        "weighted_cliques"
      ]
    },
    {
      "page": "which_multiple",
      "title": "Find the multiple or loop edges in a graph",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "any_loop",
        "any_multiple",
        "count_multiple",
        "which_loop",
        "which_multiple"
      ]
    },
    {
      "page": "which_mutual",
      "title": "Find mutual edges in a directed graph",
      "concept": [
        "structural.properties"
      ],
      "topics": [
        "which_mutual"
      ]
    },
    {
      "page": "with_edge_",
      "title": "Constructor modifier to add edge attributes",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "with_edge_"
      ]
    },
    {
      "page": "with_graph_",
      "title": "Constructor modifier to add graph attributes",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "with_graph_"
      ]
    },
    {
      "page": "with_igraph_opt",
      "title": "Run code with a temporary igraph options setting",
      "concept": [
        "igraph options"
      ],
      "topics": [
        "with_igraph_opt"
      ]
    },
    {
      "page": "with_vertex_",
      "title": "Constructor modifier to add vertex attributes",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "with_vertex_"
      ]
    },
    {
      "page": "without_attr",
      "title": "Construtor modifier to remove all attributes from a graph",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "without_attr"
      ]
    },
    {
      "page": "without_loops",
      "title": "Constructor modifier to drop loop edges",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "without_loops"
      ]
    },
    {
      "page": "without_multiples",
      "title": "Constructor modifier to drop multiple edges",
      "concept": [
        "constructor modifiers"
      ],
      "topics": [
        "without_multiples"
      ]
    },
    {
      "page": "write_graph",
      "title": "Writing the graph to a file in some format",
      "concept": [
        "foreign"
      ],
      "topics": [
        "write_graph"
      ]
    }
  ],
  "_pkglogo": "https://github.com/igraph/rigraph/raw/v2.2.2/man/figures/logo.png",
  "_readme": "https://github.com/igraph/rigraph/raw/v2.2.2/README.md",
  "_rundeps": [
    "cli",
    "cpp11",
    "glue",
    "lattice",
    "lifecycle",
    "magrittr",
    "Matrix",
    "pkgconfig",
    "rlang",
    "vctrs"
  ],
  "_sysdeps": [
    {
      "shlib": "libxml2",
      "package": "libxml2",
      "headers": "libxml2-dev",
      "source": "libxml2",
      "version": "2.9.14+dfsg-1.3ubuntu3.7",
      "name": "libxml2",
      "homepage": "http://xmlsoft.org",
      "description": "GNOME XML library"
    },
    {
      "shlib": "libglpk",
      "package": "libglpk40",
      "headers": "libglpk-dev",
      "source": "glpk",
      "version": "5.0-1build2",
      "name": "glpk",
      "homepage": "https://www.gnu.org/software/glpk/glpk.html",
      "description": "linear programming kit with integer (MIP) support"
    },
    {
      "shlib": "liblapack",
      "package": "libopenblas0-pthread",
      "source": "openblas",
      "version": "0.3.26+ds-1ubuntu0.1",
      "name": "openblas",
      "homepage": "https://www.openblas.net/",
      "description": "Optimized BLAS (linear algebra) library (shared lib, pthread)"
    },
    {
      "shlib": "libblas",
      "package": "libopenblas0-pthread",
      "source": "openblas",
      "version": "0.3.26+ds-1ubuntu0.1",
      "name": "openblas",
      "homepage": "https://www.openblas.net/",
      "description": "Optimized BLAS (linear algebra) library (shared lib, pthread)"
    },
    {
      "shlib": "libstdc++",
      "package": "libstdc++6",
      "source": "gcc",
      "version": "14.2.0-4ubuntu2~24.04.1",
      "name": "c++",
      "homepage": "http://gcc.gnu.org/",
      "description": "GNU Standard C++ Library v3"
    }
  ],
  "_vignettes": [
    {
      "source": "igraph_ES.rmd",
      "filename": "igraph_ES.html",
      "title": "igraph (interfaz R)",
      "engine": "knitr::rmarkdown",
      "headings": [
        "Instalación",
        "Uso de igraph",
        "Crear un grafo",
        "IDs de vértices y aristas",
        "Añadir y borrar vértices y aristas",
        "Construcción de grafos",
        "Establecer y recuperar atributos",
        "Propiedades estructurales de los grafos",
        "Búsqueda de vértices y aristas basada en atributos",
        "Selección de vértices",
        "Selección de aristas",
        "Tratar un grafo como una matriz de adyacencia",
        "Diseños y graficación",
        "Algoritmos de diseño",
        "Dibujar un grafo utilizando un diseño",
        "Atributos de los vértices para graficar",
        "Atributos de las aristas para graficar",
        "Argumentos más comunes de plot()",
        "igraph y el mundo exterior",
        "Dónde ir a continuación",
        "Información de la sesión"
      ],
      "created": "2023-03-06 21:22:00",
      "modified": "2025-02-20 09:08:42",
      "commits": 8
    },
    {
      "source": "igraph.Rmd",
      "filename": "igraph.html",
      "title": "igraph (R interface)",
      "engine": "knitr::rmarkdown",
      "headings": [
        "Installation",
        "Usage",
        "Creating a graph",
        "Vertex and edge IDs",
        "Adding/deleting vertices and edges",
        "Constructing graphs",
        "Setting and retrieving attributes",
        "Structural properties of graphs",
        "Querying vertices and edges based on attributes",
        "Selecting vertices",
        "Selecting edges",
        "Treating a graph as an adjacency matrix",
        "Layouts and plotting",
        "Layout algorithms",
        "Drawing a graph using a layout",
        "Vertex attributes controlling graph plots",
        "Edge attributes controlling graph plots",
        "Generic arguments of plot()",
        "igraph and the outside world",
        "Where to go next",
        "Session info"
      ],
      "created": "2023-01-27 16:46:57",
      "modified": "2025-02-20 09:08:42",
      "commits": 10
    }
  ],
  "_score": 21.09624717882622,
  "_indexed": false,
  "_nocasepkg": "igraph",
  "_universes": [
    "r-multiverse"
  ],
  "_indexurl": "https://igraph.r-universe.dev/igraph",
  "_binaries": [
    {
      "r": "4.6.0",
      "os": "linux",
      "version": "2.2.2",
      "date": "2026-04-07T08:34:19.000Z",
      "distro": "noble",
      "arch": "aarch64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "dbc2375137359384fea54aca15b8063b57299966aa277b94086cb29f6b25f2cd",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.6.0",
      "os": "linux",
      "version": "2.2.2",
      "date": "2026-04-07T08:34:39.000Z",
      "distro": "noble",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "f35ec0b71273f7666160541fa4694102243fea49ee1c54cf96044ec5f657d169",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.5.3",
      "os": "linux",
      "version": "2.2.2",
      "date": "2026-04-07T08:34:15.000Z",
      "distro": "noble",
      "arch": "aarch64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "b7651613c6bea22a30a2e1bf82b7953e05b9a4dce9cf4f6c0522614d04b5c649",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.5.3",
      "os": "linux",
      "version": "2.2.2",
      "date": "2026-04-07T08:34:07.000Z",
      "distro": "noble",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "778771ef602fe75195e0c584b85b9e3105736b5893406b7f9e5005c0b7663237",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.5.3",
      "os": "mac",
      "version": "2.2.2",
      "date": "2026-04-07T08:52:53.000Z",
      "arch": "aarch64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "260af24f075ccf087caf68720b274f2afd86d29fb4faf4145242ced2ddbd708c",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.5.3",
      "os": "mac",
      "version": "2.2.2",
      "date": "2026-04-07T08:52:12.000Z",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "1e4aac0fe8d106a121a8b962336da981c9e9e9e167d7300516327e708eb47ab1",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.6.0",
      "os": "mac",
      "version": "2.2.2",
      "date": "2026-04-07T08:53:17.000Z",
      "arch": "aarch64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "bcdfb349fe60934f2e56a804be2665dbd30c5e9776790497c3c65252a78c9659",
      "status": "success",
      "check": "WARNING",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.6.0",
      "os": "mac",
      "version": "2.2.2",
      "date": "2026-04-08T09:04:01.000Z",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "e79809d05fa6f0694192cf5b5d0d861584a03de92e40116d163a1b51d4f6684d",
      "status": "success",
      "check": "WARNING",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.7.0",
      "os": "win",
      "version": "2.2.2",
      "date": "2026-04-07T08:33:24.000Z",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "b8e1124307411b0b2e2c47d041314ab1a33524b2b9f5fc02d88c97d1ad81907c",
      "status": "success",
      "check": "WARNING",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.5.3",
      "os": "win",
      "version": "2.2.2",
      "date": "2026-04-07T08:33:19.000Z",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "cb11e091cbd23c65c44ea535cc6779e69656644e8699cb004fd23fb1d2cdcc6a",
      "status": "success",
      "check": "OK",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    },
    {
      "r": "4.6.0",
      "os": "win",
      "version": "2.2.2",
      "date": "2026-04-07T08:33:15.000Z",
      "arch": "x86_64",
      "commit": "87e5f49183c19ebad059546d3a0f3e6efbc2ca76",
      "fileid": "f0a302dca56e82a81b1a67340f6c12cde37aef8341c162329795ddd77eb41dbe",
      "status": "success",
      "check": "WARNING",
      "buildurl": "https://github.com/r-universe/r-multiverse/actions/runs/24071803292"
    }
  ]
}