Proper working implementation of a cycle detection algorithm, that
returns the cycles (rather than printing them) by constructing the
path between the two nodes that were found to be cyclic.
Patch by: Sverre Rabbelier
/**
* $Id: editor_plugin_src.js 520 2008-01-07 16:30:32Z spocke $
*
* @author Moxiecode
* @copyright Copyright © 2004-2008, Moxiecode Systems AB, All rights reserved.
*/
(function() {
tinymce.create('tinymce.plugins.Print', {
init : function(ed, url) {
ed.addCommand('mcePrint', function() {
ed.getWin().print();
});
ed.addButton('print', {title : 'print.print_desc', cmd : 'mcePrint'});
},
getInfo : function() {
return {
longname : 'Print',
author : 'Moxiecode Systems AB',
authorurl : 'http://tinymce.moxiecode.com',
infourl : 'http://wiki.moxiecode.com/index.php/TinyMCE:Plugins/print',
version : tinymce.majorVersion + "." + tinymce.minorVersion
};
}
});
// Register plugin
tinymce.PluginManager.add('print', tinymce.plugins.Print);
})();