"Borůvka's algorithm" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "head": "Borůvka's algorithm"
      },
      "expansion": "Borůvka's algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "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"
        }
      ],
      "glosses": [
        "A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected."
      ],
      "id": "en-Borůvka's_algorithm-en-name-mYwLMQfi",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "greedy algorithm",
          "greedy algorithm"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Borůvka's algorithm"
}

{
  "head_templates": [
    {
      "args": {
        "head": "Borůvka's algorithm"
      },
      "expansion": "Borůvka's algorithm",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with Ů",
        "English terms spelled with ◌̊",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "greedy algorithm",
          "greedy algorithm"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "Borůvka's algorithm"
}