Explore >> Select a destination
|
You are here 
|
opensourc.es | ||
| | | | |
cp-algorithms.com
|
|
| | | | | The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection. | |
| | | | |
skerritt.blog
|
|
| | | | | Greedy algorithms aim to make the optimal choice at that given moment. Each step it chooses the optimal choice, without knowing the future. It attempts to find the globally optimal way to solve the entire problem using this method. Why Are Greedy Algorithms Called Greedy? We call algorithms greedy when | |
| | | | |
matbesancon.xyz
|
|
| | | | | In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That's the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes. | |
| | | | |
4uinews.wordpress.com
|
|
| | | ?? ????? ???? ?? ??????? ???? ?? ???? ???? ?? ????? ?? ????? ????? ?? ????? ???? 1978 ??? ?????? ?? ?? ?? ??? ??? ????? ?????? ?? ???? ???????? ?? ?????? ???? ?? ??? ???? ?? ?????? ?? ?? ???? ??? ?? ???? ??? ?? ????? ??? ??? ?? ???????????? ?? ?? ??? ???... | ||
