Skip to content
Snippets Groups Projects

Repository graph

You can move around the graph by using the arrow keys.
Select Git revision
  • features
  • increment
  • main default protected
3 results
Created with Raphaël 2.2.018Jun179825May24last minute aesthetic cleanupmainmainlast minute quickfixLAST MINUTE DEBUG MEMORY LEAKcleanupDEBUG: removed cause of infinite loop in kmeans algorithmDEBUG: removed cause of infinite loop in kmeans_init_clustersCLEAN: compilesADD: finalised theoretical implementation, not testedEDIT: main cleanupADD: write clusters to fileADD: kmeans algorithmADD: check random centers are not already in setADD: finished cluster logic, (too?) many dereferencesEDIT: points do not need to know the cluster they belong toADD: cluster structure and beginning of logicADD: main function structure for int completerenamed cluster filescleanup: vector and clusterADD: cluster centers initialisationADD: clusterADD: begin linked list; TODO: struct cluster, struct point(vector,cluster)ADD: read vectors from filesaveincrementincrementADD: distance and argv usagefeaturesfeaturesFIX: makefile compilationADD: int vector type definitionFILE:ADD: proto.pdfinit