"polytree" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "poly",
        "3": "tree"
      },
      "expansion": "poly- + tree",
      "name": "prefix"
    }
  ],
  "etymology_text": "From poly- + tree.",
  "forms": [
    {
      "form": "polytrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "polytree (plural polytrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with poly-",
          "parents": [],
          "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 graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
      ],
      "id": "en-polytree-en-noun-OB0CG7NF",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "undirected",
          "undirected"
        ],
        [
          "path",
          "path"
        ],
        [
          "vertices",
          "vertices"
        ],
        [
          "directed",
          "directed"
        ],
        [
          "acyclic",
          "acyclic"
        ],
        [
          "cycles",
          "cycles"
        ]
      ],
      "raw_glosses": [
        "(graph theory) a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "polytree"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "poly",
        "3": "tree"
      },
      "expansion": "poly- + tree",
      "name": "prefix"
    }
  ],
  "etymology_text": "From poly- + tree.",
  "forms": [
    {
      "form": "polytrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "polytree (plural polytrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with poly-",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "graph",
          "graph"
        ],
        [
          "undirected",
          "undirected"
        ],
        [
          "path",
          "path"
        ],
        [
          "vertices",
          "vertices"
        ],
        [
          "directed",
          "directed"
        ],
        [
          "acyclic",
          "acyclic"
        ],
        [
          "cycles",
          "cycles"
        ]
      ],
      "raw_glosses": [
        "(graph theory) a graph with at most one undirected path between any two vertices. In other words, a directed acyclic graph (DAG) for which there are no undirected cycles either."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "polytree"
}