User contributions
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 20:29, 30 December 2009 (diff | hist) . . (+82) . . Segment tree (→Lazy propagation)
- 20:28, 30 December 2009 (diff | hist) . . (+10) . . Segment tree (→Lazy propagation)
- 20:28, 30 December 2009 (diff | hist) . . (+939) . . Segment tree
- 20:16, 30 December 2009 (diff | hist) . . (+6,698) . . Segment tree
- 18:12, 30 December 2009 (diff | hist) . . (+4,386) . . Segment tree
- 20:15, 29 December 2009 (diff | hist) . . (-2) . . m Segment tree (→Query)
- 20:14, 29 December 2009 (diff | hist) . . (+2,702) . . Segment tree
- 20:03, 29 December 2009 (diff | hist) . . (+155) . . File:Segtree query 92631587.png (current)
- 20:01, 29 December 2009 (diff | hist) . . (+92) . . N File:Segtree query 92631587.png (Finding the minimum element in the range <math>[9,2,6,3,1,5]</math> using this segment tree.)
- 19:31, 29 December 2009 (diff | hist) . . (+84) . . N File:Segtree 92631587.png (The result of changing the element with value 0 in the array [9,2,6,3,1,5,0,7] to 8.) (current)
- 01:03, 29 December 2009 (diff | hist) . . (+2,303) . . Segment tree
- 00:41, 29 December 2009 (diff | hist) . . (0) . . File:Segtree 92631507.png (uploaded a new version of "File:Segtree 92631507.png": better color depth) (current)
- 00:40, 29 December 2009 (diff | hist) . . (+124) . . N File:Segtree 92631507.png (The data stored in a segment tree constructed on the array [9,2,6,3,1,5,0,7] designed to answer the range minimum query.)
- 02:33, 28 December 2009 (diff | hist) . . (+27) . . m Segment tree (→Structure)
- 02:32, 28 December 2009 (diff | hist) . . (+3) . . m Segment tree (→The divide-and-conquer solution)
- 02:32, 28 December 2009 (diff | hist) . . (+1) . . m Segment tree (→Structure)
- 02:31, 28 December 2009 (diff | hist) . . (+857) . . Segment tree
- 04:04, 27 December 2009 (diff | hist) . . (+1,809) . . Segment tree
- 00:22, 27 December 2009 (diff | hist) . . (+872) . . Segment tree
- 00:16, 27 December 2009 (diff | hist) . . (+78) . . User:Brian
- 07:00, 26 December 2009 (diff | hist) . . (+1,143) . . N Segment tree (Created page with 'The '''segment tree''' is a highly versatile data structure, based upon the divide-and-conquer paradigm, which can be thought of as a tree of intervals of …')
- 05:58, 26 December 2009 (diff | hist) . . (+1) . . m Main Page
- 19:16, 25 December 2009 (diff | hist) . . (+5) . . m PEG:PEG leaders
- 19:16, 25 December 2009 (diff | hist) . . (+64) . . PEG:PEG leaders
- 18:32, 23 December 2009 (diff | hist) . . (+40) . . Nm Floyd's algorithm (Redirected page to Floyd–Warshall algorithm) (current)
- 18:30, 23 December 2009 (diff | hist) . . (+25) . . Kruskal's algorithm
- 18:30, 23 December 2009 (diff | hist) . . (+25) . . Prim's algorithm
- 18:29, 23 December 2009 (diff | hist) . . (+279) . . Bellman–Ford algorithm
- 18:28, 23 December 2009 (diff | hist) . . (+236) . . Floyd–Warshall algorithm
- 18:26, 23 December 2009 (diff | hist) . . (+2) . . m Dijkstra's algorithm (→References)
- 18:26, 23 December 2009 (diff | hist) . . (+244) . . Dijkstra's algorithm
- 18:22, 23 December 2009 (diff | hist) . . (+136) . . m Dijkstra's algorithm (→The algorithm)
- 18:20, 23 December 2009 (diff | hist) . . (+119) . . Kruskal's algorithm
- 18:18, 23 December 2009 (diff | hist) . . (+263) . . Prim's algorithm
- 18:15, 23 December 2009 (diff | hist) . . (+2,236) . . Kruskal's algorithm
- 17:53, 23 December 2009 (diff | hist) . . (+875) . . PEGWiki:Notational conventions (→Technical notation)
- 17:38, 23 December 2009 (diff | hist) . . (+230) . . Prim's algorithm (→The algorithm)
- 06:18, 22 December 2009 (diff | hist) . . (+352) . . Kruskal's algorithm
- 03:29, 22 December 2009 (diff | hist) . . (+5,311) . . N Kruskal's algorithm (Created page with ''''Kruskal's algorithm''' is a general-purpose algorithm for the minimum spanning tree problem, based on the disjoint sets data structure. The existence of very simple al…')
- 18:12, 20 December 2009 (diff | hist) . . (+4,683) . . N Prim's algorithm (Created page with ''''Prim's algorithm''' is one of the simplest and best-known minimum spanning tree algorithms. It is closely analogous to Dijkstra's algorithm, the only difference being …')
- 18:05, 20 December 2009 (diff | hist) . . (-3) . . m Dijkstra's algorithm (→Implementation)
- 17:54, 20 December 2009 (diff | hist) . . (+17) . . PEG:PEG leaders
- 17:37, 20 December 2009 (diff | hist) . . (+20) . . PEG:PEG leaders
- 07:14, 20 December 2009 (diff | hist) . . (-21) . . PEG:Event calendar 2009/2010
- 07:12, 20 December 2009 (diff | hist) . . (0) . . m PEG:PEG leaders (moved PEG:PEG Leaders to PEG:PEG leaders: incorrect capitalization)
- 07:12, 20 December 2009 (diff | hist) . . (+29) . . N PEG:PEG Leaders (moved PEG:PEG Leaders to PEG:PEG leaders: incorrect capitalization) (current)
- 05:51, 20 December 2009 (diff | hist) . . (-1) . . m Deque (→C++ STL deque class)
- 05:48, 20 December 2009 (diff | hist) . . (+8,837) . . N Deque (Created page with 'A '''deque''' is a data structure containing zero or more items, all of the same type, which may be thought to represent the items lined up in single file with a front and a back…')
- 05:24, 20 December 2009 (diff | hist) . . (+212) . . Queue
- 05:24, 20 December 2009 (diff | hist) . . (+210) . . Stack (→C++ STL stack class)
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
