Difference between revisions of "PEGWiki:Community Portal"
From PEGWiki
Markin2000 (Talk | contribs) (→Page request) |
(→Page request) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 6: | Line 6: | ||
REQUEST | REQUEST | ||
| + | - Centroid decomposition and example problems solved with it | ||
- Fenwick Trees/ Binary Indexed Trees (with ranged update and ranged query) | - Fenwick Trees/ Binary Indexed Trees (with ranged update and ranged query) | ||
- Line sweep/ sweeping line algorithm and its applications | - Line sweep/ sweeping line algorithm and its applications | ||
- Push–relabel maximum flow algorithm and it's implementation | - Push–relabel maximum flow algorithm and it's implementation | ||
- How to find the center of a weighted tree | - How to find the center of a weighted tree | ||
| + | - Suffix Tree / Suffix Array and its applications | ||
Latest revision as of 22:00, 15 August 2017
Call for diagrams[edit]
Many confusing concepts in computer science, especially in graph theory, are effectively explained through the use of diagrams. However, I am not especially skilled at creating diagrams, so someone else needs to either create and upload them or find diagrams from other sources that can be licensed under CC-BY. I am placing pages that require diagrams in Category:Pages needing diagrams. Brian 23:43, 17 November 2009 (UTC)
Page request[edit]
Is there a topic you'd like to see covered? List it here and we'll see what we can do! Brian 15:45, 10 January 2010 (UTC)
REQUEST
- Centroid decomposition and example problems solved with it - Fenwick Trees/ Binary Indexed Trees (with ranged update and ranged query) - Line sweep/ sweeping line algorithm and its applications - Push–relabel maximum flow algorithm and it's implementation - How to find the center of a weighted tree - Suffix Tree / Suffix Array and its applications
