Good news! I have successfully collected the rare and mysterious article "A heuristic for graph drawing" by Peter Eades from the 1984 Congressus Numerantium Vol. 42 and have successfully created a working model of the algorithm described within.
Of course, "working" is very different to "accurately drawing a graph", given an input in the form of a chaco file, I am returned with coordinates for my drawing algorithm (currently drawn via sketches as said algorithm is not accessible in my current position - though it does exist as shown in previous blog entries). [pictures will be uploaded when the drawing algorithm is accessible or when I create a new drawing algorithm].
Next stop - completion of a fully working (I mean "drawing graph accurately" working) implementation of P.Eades Heuristic Algorithm, expanding upon this to include the multileveling and coarsening used in Walshaw's work and a deeper look into the storage of data (specifically Arrays and how to increase efficiency and speed).
No comments:
Post a Comment