"semi-complete" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "complete"
      },
      "expansion": "semi- + complete",
      "name": "prefix"
    }
  ],
  "etymology_text": "semi- + complete",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "semi-complete (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "glosses": [
        "partially complete"
      ],
      "id": "en-semi-complete-en-adj-2gB8kR58",
      "links": [
        [
          "partially",
          "partially"
        ],
        [
          "complete",
          "complete"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "1 99",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "8 92",
          "kind": "other",
          "name": "English terms prefixed with semi-",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "of or pertaining to a graph in which, for any two verticies u, v in the graph, there is another vertex w which is adjacent to both u and v (i.e. u,w,v is a path in that graph)."
      ],
      "id": "en-semi-complete-en-adj-29QPJwvK",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph theory",
          "graph theory"
        ],
        [
          "verticies",
          "vertex"
        ]
      ],
      "raw_glosses": [
        "(mathematics, graph theory) of or pertaining to a graph in which, for any two verticies u, v in the graph, there is another vertex w which is adjacent to both u and v (i.e. u,w,v is a path in that graph)."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "_dis1": "0 0",
      "word": "semicomplete"
    }
  ],
  "word": "semi-complete"
}

{
  "categories": [
    "English adjectives",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English terms prefixed with semi-",
    "English uncomparable adjectives"
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "semi",
        "3": "complete"
      },
      "expansion": "semi- + complete",
      "name": "prefix"
    }
  ],
  "etymology_text": "semi- + complete",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "semi-complete (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "glosses": [
        "partially complete"
      ],
      "links": [
        [
          "partially",
          "partially"
        ],
        [
          "complete",
          "complete"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    },
    {
      "categories": [
        "en:Graph theory",
        "en:Mathematics"
      ],
      "glosses": [
        "of or pertaining to a graph in which, for any two verticies u, v in the graph, there is another vertex w which is adjacent to both u and v (i.e. u,w,v is a path in that graph)."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "graph theory",
          "graph theory"
        ],
        [
          "verticies",
          "vertex"
        ]
      ],
      "raw_glosses": [
        "(mathematics, graph theory) of or pertaining to a graph in which, for any two verticies u, v in the graph, there is another vertex w which is adjacent to both u and v (i.e. u,w,v is a path in that graph)."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "semicomplete"
    }
  ],
  "word": "semi-complete"
}