http://d.puremagic.com/issues/show_bug.cgi?id=9673
--- Comment #9 from Martin Nowak <[email protected]> 2013-03-11 11:55:25 PDT --- (In reply to comment #8) > Great idea, although we'd need to amend things. First, the graph is directed > (not sure whether k-means clustering is directly applicable to directed > graphs, > a cursory search suggests it doesn't). > I didn't thought about graph clustering. > Second, for each node we don't have the edges, but instead all paths (that's > what dmd -v generates). So we can take advantage of that information. A simple > thought is to cluster based on the maximum symmetric difference between module > dependency sets, i.e. separately compile modules that have the most mutually > disjoint dependency sets. > That's more of what I had in mind. I'd use k-means to minimize the differences between the dependency sets of each module and the module set of their centroids. > Anyhow I wouldn't want to get too bogged down into details at this point - > first we need to get the appropriate infrastructure off the ground. Right, but I'm happy to experiment with clustering once this is done. -- Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email ------- You are receiving this mail because: -------
