翻訳と辞書 Words near each other ・ Multitasker ・ Multitasking (disambiguation) ・ Multiteam system ・ Multiteatro ・ Multitenancy ・ Multitheoretical psychotherapy ・ Multithreading ・ Multithreading (computer architecture) ・ MultiThématiques ・ Multitier architecture ・ Multiton pattern ・ Multitone Records ・ Multitrack recording ・ Multitrait-multimethod matrix ・ Multitran ・ Multitree ・ Multitronic ・ Multituberculata ・ Multitubulatina ・ Multitude ・ Multitude Media ・ Multitudes ・ Multiunit auction ・ Multiuse Model View ・ Multiuser detection ・ Multiuser DOS ・ Multiuser DOS Federation ・ Multiusos Ciudad de Cáceres ・ Multivac ・ MultiValue Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Multitree ： ウィキペディア英語版 Multitree In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set that does not have four items ''a'', ''b'', ''c'', and ''d'' forming a diamond suborder with and but with ''b'' and ''c'' incomparable to each other (also called a diamond-free poset〔.〕). ==Equivalence between directed acyclic graph and poset definitions== If ''G'' is a directed acyclic graph ("DAG") in which the nodes reachable from each vertex form a tree (or equivalently, if ''G'' is a directed graph in which there is at most one directed path between any two nodes, in either direction) then the reachability relation in ''G'' forms a diamond-free partial order. Conversely, if ''P'' is a diamond-free partial order, its transitive reduction forms a DAG in which the successors of any node form a tree. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Multitree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.