make sure that roots() returns nodes in children insert order which is also consistent with bfs tarversal order.

1 files changed, 2 insertions, 3 deletions

diff --git a/init.lua b/init.lua
index 1ba4d90..9bc15c6 100644
--- a/init.lua
+++ b/init.lua
@@ -133,7 +133,7 @@ function Graph:roots()
 	for root,i in pairs(rootnodes) do
 		table.insert(roots, root)
 	end
-	table.sort(roots,function(a,b) return rootnodes[a] < rootnodes[b] end )
+	table.sort(roots,function(a,b) return self.nodes[a] < self.nodes[b] end )
 	return roots
 end
 
@@ -142,11 +142,10 @@ function Graph:todot()
 	local edges = self.edges
 	str = {}
 	table.insert(str,'digraph G {\n')
-	table.insert(str,'node [shape = circle]; ')
+	table.insert(str,'node [shape = oval]; ')
 	local nodelabels = {}
 	for i,node in ipairs(nodes) do
 		local l =  '"' .. (node:label() or 'n' .. i) .. '"'
-		l = l:gsub('\n','') 
 		nodelabels[node] = 'n' .. i
 		table.insert(str, '\n' .. nodelabels[node] .. '[label=' .. l .. '];')
 	end