Projects tagged ‘c’ and ‘graphs’

Main project: Mapping,discovering relations and mining conclusive data from social networks. There are various other projects meant as utilities or code that can be re-used in some projects.

Application of a Ant Colony Optimization algorithm for the Capacitated Vehicle Routing Problem. We intend to show results concerning parameters choice, parallel implementations and general ... [More] conclusions in an article in the SVN repository. This work was done in a brief internship at INPE - Brasil, on '09. Authors: Giuliano Vilela, José C. Becceneri. [Less]

Showgraph is a simple graph editor/viewer. It allows for creating nodes and connecting them with edges. Nodes have editable labels and edges can be routed using control points. One of primary goals ... [More] was to create lightweight and easy-to-use tool for fast construction of a graph's visual representation. Nodes are simply created by double-click on background and edges are created by pressing right mouse button on one node, holding it down while moving to other node and finally releasing it on the target node. Nodes can be moved around by simply dragging them. Showgraph also features an auto-layout for directed graphs. Once you have constructed graph you can use automatic layout to provide a basic structured view that can be further adjusted manually to produce nicer image of the graph. Constructed graphs are stored in XML files. Graph images can be exported in various formats or sent to printer. Showgraph is also capable of parsing compiler dumps and displaying CFG along with text dump for user-selected basic blocks. This allows for using it as an IR browser. This part is not fully implemented by now, but testing-purpose parser provides and example of implementation. One can easily extend it for parsing real compiler dumps. Project implements prototype for http://code.google.com/p/mipt-vis/ This allows mentors of MIPT_VIS test some features before students get to implement them. See http://code.google.com/p/mipt-vis/ for more info [Less]

libeds is an extensible data structures library for C language. it contains:  lists:   - unary-linked lists   - double-linked lists   - multi-linked lists ... [More]  trees:   binary:    - red-black    - randomized    - splay    - avl   other:    - b tree(... in progress)  - hash table  - vector  - stack  - queues  graphs:   ... in progress btw: you can hold data of any type in each data structure Each data structure may be converted to other one. main feature of this library is quite common API for all data structures, which contains in the same family(for example all list have identical API, all binary trees have identical API and so on...). everyone can easily add his implementation of needed data structure, using data structure family API. if you want to add new kind of list or just replace implementation of some list function, it's really quite simple. you just use common list API. Moreover, you can easily to add your own data structure family and implement some kinds of it. join and enjoy. [Less]