"intervertex" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "inter",
        "3": "vertex"
      },
      "expansion": "inter- + vertex",
      "name": "prefix"
    }
  ],
  "etymology_text": "From inter- + vertex.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intervertex (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with inter-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              105,
              116
            ]
          ],
          "ref": "2016, Sergey Melnik, James P. Gleeson, “Simple and accurate analytical calculation of shortest path lengths”, in arXiv:",
          "text": "We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Between vertices."
      ],
      "id": "en-intervertex-en-adj-hETu-2g7",
      "links": [
        [
          "vertices",
          "vertex"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)tɛks"
    }
  ],
  "word": "intervertex"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "inter",
        "3": "vertex"
      },
      "expansion": "inter- + vertex",
      "name": "prefix"
    }
  ],
  "etymology_text": "From inter- + vertex.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intervertex (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with inter-",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "Rhymes:English/ɜː(ɹ)tɛks",
        "Rhymes:English/ɜː(ɹ)tɛks/4 syllables"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              105,
              116
            ]
          ],
          "ref": "2016, Sergey Melnik, James P. Gleeson, “Simple and accurate analytical calculation of shortest path lengths”, in arXiv:",
          "text": "We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Between vertices."
      ],
      "links": [
        [
          "vertices",
          "vertex"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)tɛks"
    }
  ],
  "word": "intervertex"
}