A fast algorithm to visualize tree structures
Python
Permalink
Failed to load latest commit information.
app
bin
images
lib
test
Makefile
README.md
edgelist-sample
ez-visualize.py
fs-mkel.py
one-layer-benchmark.py
setup.py

README.md

HeiankyoView

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?

This algorithm is named HeiankyoView becaused the visulization image is just like the map of Heian-kyo.
Heian-kyo map

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!

Linus Torvalds is the mayor of this city. Where do you live in this city?
Visualizing Linux kernel

Example

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.

INPUT:

$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).

OUTPUT:

$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

Run #make install and HeiankyoView is simply ready.
For testing, run $make runtest and $heiankyoview edgelist.sample are provided.

Developer Info

Akira Hayakawa(@akiradeveloper)
e-mail: ruby.wktk@gmail.com