Gtk2::Ex::MindMapView::Graph 0.000001

Gtk2::Ex::MindMapView::Graph is a Perl module that manages a directed graph. SYNOPSIS use Gtk2::Ex::MindMapView::Graph; This is internal to Gtk2::Ex::MindMapView. Its a wrapper around Jarkko Heitaniemis nice Graph module. This module is instantiated by Gtk2::Ex::MindMapView. INTERFACE Gtk2::Ex::MindMapView::Graph->new() Create a Gtk2::Ex::MindMapView::Graph. add ($item) Add a root Gtk2::Ex::MindMapView::Item to the graph. Only one of these may be added, or you will get an error. add ($predecessor_item, $item) Add a Gtk2::Ex::MindMapView::Item to the graph. Attach the item to the predecessor item. get_root() Return the root item of the graph. has_item($item) Return true if the graph contains the item. num_items($item) Return the number of items in the graph. predecessors($item) Return the predecessor items of a given Gtk2::Ex::MindMapView::Item. remove ($item) Remove a Gtk2::Ex::MindMapView::Item from the graph. Attach any successor items that the item may have had to the items predecessor. set_root ($item) Change the root item in the graph. An new graph is created with the new root. successors ($item) Return the successor items of a given Gtk2::Ex::MindMapView::Item. traverse_DFS ($item, $callback) Perform a depth-first traversal of the graph, repeatedly calling the callback. The traversal algorithm given in Graph.pm returns items in an unpredictable order which causes the items in the mind map to be placed differently each time the map is redrawn. So we use our own method that returns items in the same order. Need to do something about all these traversal routines. traverse_BFS ($item, $callback) Perform a breadth-first traversal of the graph, repeatedly calling the callback. The traversal algorithm given in Graph.pm returns items in an unpredictable order which causes the items in the mind map to be placed differently each time the map is redrawn. So we use our own method that returns items in the same order. Need to do something about all these traversal routines. traverse_preorder_edge($predecessor_item, $item, $callback) Perform a depth first traversal and pass back the predecessor item as well as the item to the callback. Need to do something about all these traversal routines. traverse_postorder_edge($predecessor_item, $item, $callback) Perform a depth first traversal and pass back the predecessor item as well as the item to the callback. Need to do something about all these traversal routines..

Requirements:	No special requirements
Platforms:	Linux
Keyword:	Callback,  Do Something,  Graph,  Item,  Items,  Libraries,  Mindmapview,  Perl Module,  Predecessor,  Programming,  To Do,  Traversal
Users rating:	0/10