Revision as of 20:12, 22 July 2021 edit Mgkrupa (talk \| contribs) Extended confirmed users 27,627 edits No information was added, removed, or changed. Only copy editing to make this article more compliant with MOS:MATH and WP:ACCESSIBILITY. Minor rewording/rearranging/fixes. Spell out abbreviations s.t./iff/i.e./can't/... and symbols ∀∃⇔⇒∨∧¬ (exceptions for e.g. formal logic). Try to write complete sentences. Avoid we/one/us/clearly/note/... Avoid symbols that might not render correctly in some browsers like Unicode ∪∩≠≤→∈∑⊕√∞ or σℱ𝔉𝔽ℝℂℕ by e.g. replacing them with LaTeX. ← Previous edit		Revision as of 07:50, 20 September 2021 edit undo Jmcclaskey54 (talk \| contribs) 243 edits m corrected capitalization Tags: Visual edit Mobile edit Mobile web edit Advanced mobile edit Next edit →
Line 56: == Related results == The order extension principle is [[Constructive proof\|constructively provable]] for {{em\|finite}} sets using [[topological sorting]] algorithms, where the partial order is represented by a [[~~Directed~~directed acyclic graph]] with the set's elements as its [[Vertex (graph theory)\|vertices]]. Several algorithms can find an extension in [[linear time]].<ref>{{citation \| last1 = Cormen \| first1 = Thomas H. \| author1-link = Thomas H. Cormen \| last2 = Leiserson \| first2 = Charles E. \| author2-link = Charles E. Leiserson

Linear extension: Difference between revisions