| | 1 | = GSoC 2010 Project Ideas = |
| | 2 | |
| | 3 | == `PyLemon` Module == |
| | 4 | mentor: Alpár Jüttner |
| | 5 | |
| | 6 | === Background === |
| | 7 | |
| | 8 | LEMON was written in C++, because this is the only widely used programming language that makes is possible to optimize the running time and memory usage of complex data-structures and algorithms to the extreme. However C++ is a rather complex language, which require deep knowledge of programming, and it's usage is many times complicated. Experimenting with and idea and prototyping solution can be much simpler in modern interpreted and dynamically linked languages. Python is a prominent member of these languages, being easy-to-learn, versatile and extremely productive. Python is also a highly extensible language, which allows programmers to create their own modules in C or C++. |
| | 9 | |
| | 10 | === The Task === |
| | 11 | |
| | 12 | The goal is to create a Python interface module to LEMON's data structures and algorithms (written in C++), thus combine the high efficiency of LEMON with the flexibility of Python. |
| | 13 | |
| | 14 | You can find the pre-alpha version of this project in our repository: [http://lime.cs.elte.hu/~alpar/hg/pylemon/] |
| | 15 | |
| | 16 | === Application conditions === |
| | 17 | |
| | 18 | - knowledge of C++ language |
| | 19 | - knowledge of Python language or have a tendency to learn it |
| | 20 | - basic knowledge of graph theory |
| | 21 | - English language knowledge |
| | 22 | |
| | 23 | === Benefits of participating === |
| | 24 | |
| | 25 | By taking part in this project, you can highly improve both your C++ and Python skills. In addition, understanding LEMON is a good opportunity to learn more about network modeling, graph algorithms and combinatorial optimization. |
| | 26 | |
| | 27 | |
| | 28 | |
| | 29 | == Thread safe graph maps == |
| | 30 | mentor: Alpár Jüttner |
| | 31 | |
| | 32 | === Background === |
| | 33 | |
| | 34 | === The Task === |
| | 35 | |
| | 36 | === Application conditions === |
| | 37 | |
| | 38 | - knowledge of C++ language |
| | 39 | - basic knowledge of graph theory |
| | 40 | - English language knowledge |
| | 41 | |
| | 42 | === Benefits of participating === |
| | 43 | |
| | 44 | == Cairo based graph visualization == |
| | 45 | mentor: Alpár Jüttner |
| | 46 | |
| | 47 | === Background === |
| | 48 | |
| | 49 | === The Task === |
| | 50 | |
| | 51 | === Application conditions === |
| | 52 | |
| | 53 | - knowledge of C++ language |
| | 54 | - basic knowledge of graph theory |
| | 55 | - English language knowledge |
| | 56 | |
| | 57 | === Benefits of participating === |
