A fast algorithm to visualize tree structures.
My past work in B.S.
What is Heian-kyo?
Heian-kyo was one of the several former names for the city now known as Kyoto.
Please also see the wikipedia page.
So, what is HeiankyoView?
HeiankyoView is originally developed by Takayuki Itoh and the algorithm is improved later by a prominent bachelor student, Akira Hayakawa of Kyoto university.
It's time to visualize the Linux kernel source tree!
heiankyoview command is a simple tool to pack tree structures.
As an input, you must write edge list like below.
We shall save this to a file edgelist.sample.
$cat edgelist-sample 1,2 1,3 2,4
We will feed the file to heiankyoview command.
Each row describes (NodeID, xCoord, yCoord, width, height).
$heiankyoview edgelist-sample 1,0.000000,0.000000,30.000000,18.000000 3,8.000000,2.000000,10.000000,10.000000 2,-6.000000,0.000000,14.000000,14.000000 4,-6.000000,0.000000,10.000000,10.000000
Install and Test
#make install and HeiankyoView is simply ready.
For testing, run
$make runtest and
$heiankyoview edgelist.sample are provided.