"arbre recouvrant minimal" meaning in Français

{
  "categories": [
    {
      "kind": "other",
      "name": "Compositions en français",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Locutions nominales en français",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Traductions en anglais",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "Français",
      "orig": "français",
      "parents": [],
      "source": "w"
    }
  ],
  "etymology_texts": [
    "Composé de arbre, recouvrant et minimal."
  ],
  "forms": [
    {
      "form": "arbres recouvrants minimaux",
      "ipas": [
        "\\aʁ.bʁ(.ə) ʁə.ku.vʁɑ̃ mi.ni.mo\\"
      ],
      "tags": [
        "plural"
      ]
    },
    {
      "form": "arbre couvrant de poids minimal"
    },
    {
      "form": "arbre couvrant minimum"
    },
    {
      "form": "arbre sous-tendant minimum"
    }
  ],
  "lang": "Français",
  "lang_code": "fr",
  "pos": "noun",
  "pos_title": "Locution nominale",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Exemples en français",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Lexique en français de la théorie des graphes",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              19,
              43
            ]
          ],
          "ref": "Algorithmes et structures de données avec Ada, C++ et Java, Abdelali Guerid, Pierre Breguet, Henri Röthlisberger, 2002",
          "text": "Pour construire un arbre recouvrant minimal, il suffit donc de partir de n'importe quel sommet et d'y relier successivement les sommets par les arcs de poids minimal."
        }
      ],
      "glosses": [
        "Type d'arbre dans un graphe non orienté, qui en relie tous les sommets."
      ],
      "id": "fr-arbre_recouvrant_minimal-fr-noun-qLBzQUvK",
      "raw_tags": [
        "Théorie des graphes"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "\\aʁ.bʁə ʁə.ku.vʁɑ̃ mi.ni.mal\\"
    },
    {
      "audio": "LL-Q150 (fra)-Lepticed7-arbre recouvrant minimal.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/3a/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/3a/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav.ogg",
      "raw_tags": [
        "France (Toulouse)"
      ],
      "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-arbre recouvrant minimal.wav"
    }
  ],
  "tags": [
    "masculine"
  ],
  "translations": [
    {
      "lang": "Anglais",
      "lang_code": "en",
      "word": "minimum spanning tree"
    }
  ],
  "word": "arbre recouvrant minimal"
}

{
  "categories": [
    "Compositions en français",
    "Locutions nominales en français",
    "Traductions en anglais",
    "français"
  ],
  "etymology_texts": [
    "Composé de arbre, recouvrant et minimal."
  ],
  "forms": [
    {
      "form": "arbres recouvrants minimaux",
      "ipas": [
        "\\aʁ.bʁ(.ə) ʁə.ku.vʁɑ̃ mi.ni.mo\\"
      ],
      "tags": [
        "plural"
      ]
    },
    {
      "form": "arbre couvrant de poids minimal"
    },
    {
      "form": "arbre couvrant minimum"
    },
    {
      "form": "arbre sous-tendant minimum"
    }
  ],
  "lang": "Français",
  "lang_code": "fr",
  "pos": "noun",
  "pos_title": "Locution nominale",
  "senses": [
    {
      "categories": [
        "Exemples en français",
        "Lexique en français de la théorie des graphes"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              19,
              43
            ]
          ],
          "ref": "Algorithmes et structures de données avec Ada, C++ et Java, Abdelali Guerid, Pierre Breguet, Henri Röthlisberger, 2002",
          "text": "Pour construire un arbre recouvrant minimal, il suffit donc de partir de n'importe quel sommet et d'y relier successivement les sommets par les arcs de poids minimal."
        }
      ],
      "glosses": [
        "Type d'arbre dans un graphe non orienté, qui en relie tous les sommets."
      ],
      "raw_tags": [
        "Théorie des graphes"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "\\aʁ.bʁə ʁə.ku.vʁɑ̃ mi.ni.mal\\"
    },
    {
      "audio": "LL-Q150 (fra)-Lepticed7-arbre recouvrant minimal.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/3a/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/3/3a/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav/LL-Q150_(fra)-Lepticed7-arbre_recouvrant_minimal.wav.ogg",
      "raw_tags": [
        "France (Toulouse)"
      ],
      "wav_url": "https://commons.wikimedia.org/wiki/Special:FilePath/LL-Q150 (fra)-Lepticed7-arbre recouvrant minimal.wav"
    }
  ],
  "tags": [
    "masculine"
  ],
  "translations": [
    {
      "lang": "Anglais",
      "lang_code": "en",
      "word": "minimum spanning tree"
    }
  ],
  "word": "arbre recouvrant minimal"
}