An Algorithm Tool for Atom Decomposition and Interaction: AD Visualiser

Algorithm 2

Tree building algorithm.

Input: An OntologyO
Output: A DAGgraph
(1)	supperClass ← owl: Thing;
(2)	supper ← Node sup perClass;
(3)	repeat
(4)	if subClasses (supperClass) owlNothingsubClasses (supperClass)
then
(5)	foreachsubClass ∈ subClasses(supperClass)do
(6)	subNode ← subClass
(7)	supperNode.addSubNode(subNode);
(8)	supperClass ← subClass;
(9)	endfor
(10)	endif
(11)	until add all the classes as nodes in the tree
(12)	show the result tree;