COIN-OR::LEMON - Graph Library

Changes between Version 13 and Version 14 of GSoC2010


Ignore:
Timestamp:
03/05/10 17:15:54 (9 years ago)
Author:
Alpar Juttner
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • GSoC2010

    v13 v14  
    1616== Project Ideas ==
    1717
    18 === `PyLemon` Module ===
    19 mentor: Alpár Jüttner
    20 
    21 ==== Background ====
    22 
    23 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++.
    24 
    25 ==== The Task ====
    26 
    27 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.
    28 
    29 You can find the pre-alpha version of this project in our repository: [http://lime.cs.elte.hu/~alpar/hg/pylemon/]
    30 
    31 ==== Application conditions ====
    32 
    33  - knowledge of C++ language
    34  - knowledge of Python language or have a tendency to learn it
    35  - basic knowledge of graph theory
    36  - English language knowledge
    37 
    38 ==== Benefits of participating ====
    39 
    40 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.
    41 
    42 
    43 
    44 === Thread safe graph maps ===
    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 ====
    58 
    59 === Cairo based graph visualization ===
    60 mentor: Alpár Jüttner
    61 
    62 ==== Background ====
    63 
    64 ==== The Task ====
    65 
    66 ==== Application conditions ====
    67 
    68  - knowledge of C++ language
    69  - basic knowledge of graph theory
    70  - English language knowledge
    71 
    72 ==== Benefits of participating ====
     18Please visit our [wiki:GSoC2010Ideas Project ideas] page.