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.
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).
the programming language must be C