Definitions from Wiktionary (polytree)
▸ noun: (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.
▸ Words similar to polytree
▸ Usage examples for polytree
▸ Idioms related to polytree
▸ Wikipedia articles (New!)
▸ Popular adjectives describing polytree
▸ Words that often appear near polytree
▸ Rhymes of polytree
▸ Invented words related to polytree
▸ noun: (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.
Similar:
tree,
multitree,
directed acyclic graph,
forest,
caterpillar tree,
plane tree,
acyclic digraph,
dipath,
hypertree,
dicycle,
more...
Opposite:
▸ Words similar to polytree
▸ Usage examples for polytree
▸ Idioms related to polytree
▸ Wikipedia articles (New!)
▸ Popular adjectives describing polytree
▸ Words that often appear near polytree
▸ Rhymes of polytree
▸ Invented words related to polytree