core/graph: compute vertical partitions and left classes
core/graph: implement place_left
core/graph: implement adjust_left_class
core/graph: implement methods called in place_virtuals for left/right
util/stack: extend stack api with r_stack_size
core/graph: use RStack instead of a custom implementation
util/graph: change implementation to use lists and extend api
core/cmd_debug: avoid free r_graph_get_nodes
core/graph: rename some functions and use typedefs for graph struct
core/graph: use RGraph for the ascii art graph
util/list: add const whenever possible
util/graph: add const on r_graph_get_nodes/neighbours
core/graph,core/cmd_debug: use const
core/graph: clean the code (add comments, use const, remove magic nums)
* use r_graph_node_iter for the current node
* reset graph when reloading nodes
* on callgraph edges printing, nth should be 0
* force seek of current node when reloading nodes
* use graph_foreach_node
* core/graph: remove get_current_node because useless
* r_cons_get_size should return the number of rows, why is there a "-1"?
* the newline at the end of the canvas converted to string (in
r_cons_canvas_to_string) make things shift up one line
* r_cons_canvas_write should consider "left" (which is the number of
chars available from x until the right side of the screen) and not
"left - 1". Moreover, since "slen" is at most the maximum number of
characters that we can print in that row, there is no need to check
if we can write those bytes
* r_cons_flush usually add a newline, but we shouldn't print it because
otherwise everything will shift up by one line
leave the selection of the right thing to do to sub-functions.
reload_nodes choose which node to reload based on the status of g.
graph_set_layout choose which layout to apply based on the status of g.
core/graph: extrat struct graph
core/graph: replace updateSeek with graph_update_seek
core/graph: change names to some functions
core/graph: refactoring of graph_set_layout
core/graph: make ostack part of the struct graph
