User contributions
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)
- 21:07, 18 March 2011 (diff | hist) . . (0) . . m Partial order (→Wellorder)
- 21:05, 18 March 2011 (diff | hist) . . (+9,590) . . N Partial order (Created page with "''This article aims to provide an introduction to partial orders suitable for programmers. It is not intended to be a comprehensive overview of the mathematical theory. Changes t...")
- 18:46, 18 March 2011 (diff | hist) . . (+5,682) . . N Topological sort (Created page with "The '''topological sorting problem''' is the problem of determining a '''topological ordering''' of a digraph's vertices, that is, a list of the vertices such that an edge never ...")
- 18:04, 18 March 2011 (diff | hist) . . (+30) . . N Topological sorting (Redirected page to Topological sort) (current)
- 05:36, 18 March 2011 (diff | hist) . . (+158) . . Directed acyclic graph (→Problems: - longest path) (current)
- 19:48, 17 March 2011 (diff | hist) . . (+2,991) . . Directed acyclic graph
- 06:38, 17 March 2011 (diff | hist) . . (+2,684) . . N Directed acyclic graph (Created page with "A '''directed acyclic graph (DAG)''' is a directed graph that contains no cycles. DAGs arise in a natural way in modelling situations in which, in some sense, going "forward"...")
- 02:59, 16 March 2011 (diff | hist) . . (+2,173) . . Big numbers (addition)
- 15:12, 14 March 2011 (diff | hist) . . (+36) . . N DAG (Redirected page to Directed acyclic graph) (current)
- 18:20, 12 March 2011 (diff | hist) . . (+10,628) . . Tree
- 08:09, 12 March 2011 (diff | hist) . . (-1) . . m Tree (→Anatomy: - oops)
- 08:09, 12 March 2011 (diff | hist) . . (+1,021) . . Tree
- 07:57, 12 March 2011 (diff | hist) . . (+278) . . Tree
- 07:55, 12 March 2011 (diff | hist) . . (-2) . . m Tree (→Characterization: - grammar)
- 07:55, 12 March 2011 (diff | hist) . . (+63) . . Tree
- 07:55, 12 March 2011 (diff | hist) . . (+63) . . Graph theory
- 07:54, 12 March 2011 (diff | hist) . . (+5,081) . . N Tree (Created page with "A '''tree''' is a connected, acyclic, undirected graph. Trees are named for their resemblance to the eponymous tall, woody plants, as these are also connected and acyclic (a ...")
- 03:08, 12 March 2011 (diff | hist) . . (+103) . . Graph theory (+digraph, +arc)
- 23:40, 11 March 2011 (diff | hist) . . (+503) . . Depth-first search
- 23:33, 11 March 2011 (diff | hist) . . (+3,512) . . Breadth-first search (current)
(newest | oldest) View (newer 20 | older 20) (20 | 50 | 100 | 250 | 500)