Em Andamento

graph clustering

get a directed acyclic graph from a file

the graph has a vertex( node) and edge with weights given to the vertices and edges. the area of the nodes will be a fixed value say .1.( which corresponds to its weight)

the graph has to be implemented using a linked list

we have to find the cliques that satisfies the area and size requirements

the area requirement: the clique must not exceed the area requirement set by the user say 1.25.

the size is the number of nodes( individual vertices ) in the clique that is say 5.

the clustering part

================

once the maximum clique that is got satisfies the above criteria the Vertices are collapsed to form a single vertex with weight given by the summation of the individual vertices.

the internal edges are collapsed and the outer edges that connect ( that are coming from vertices that are connected to other nodes outside the clique ) other nodes are retained and their weights are given as summation of the collapsed inner edges.

the clustering process is repeated till you end up with no more clusters being formed.

the time for the process has to be determined.

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.

3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).

## Platform

windows

the programming language must be C

MS VC++

Habilidades: Programação C, Engenharia, MySQL, PHP, Arquitetura de software, Teste de Software

Ver mais: vertices graph, vertices nodes, vertex programming software, the graph, programming language list, programming graph, part graph, nodes edges, node programming language, node programming, node graph, maximum vertex, list graph, graph using, graph s, graph program, graph part, graph nodes, graph node edge, graph node, graph programming, graph edge, graph c, functional programming language, for graph

Acerca do Empregador:
( 4 comentários ) United States

ID do Projeto: #2980211

Premiar a:

ndima

See private message.

$21.25 USD em 3 dias
(96 Avaliações)
6.6

7 freelancers estão ofertando em média $36 para este trabalho

mihaiscortaru

See private message.

$42.08 USD in 3 dias
(160 Comentários)
6.0
projetcoder

See private message.

$59.5 USD in 3 dias
(39 Comentários)
5.0
shashikhanvw

See private message.

$57.8 USD in 3 dias
(15 Comentários)
3.8
vw966435vw

See private message.

$11.05 USD in 3 dias
(12 Comentários)
2.5
phdonnelly

See private message.

$34 USD in 3 dias
(2 Comentários)
1.6
piousvw

See private message.

$25.5 USD in 3 dias
(0 Comentários)
0.0