javascript/examples/grapheditor/www/js/Graph.js
function checkNode(node, clone)
			{
				if (node != null)
				{
					if (clone.originalNode != node)
					{
						cleanNode(node);
					}
					else
					{
						node = node.firstChild;
						clone = clone.firstChild;
						
						while (node != null)
						{
							var nextNode = node.nextSibling;
							
							if (clone == null)
							{
								cleanNode(node);
							}
							else
							{
								checkNode(node, clone);
								clone = clone.nextSibling;
							}
	
							node = nextNode;
						}
					}
				}
			}
function checkNode(node, clone)
			{
				if (node != null)
				{
					if (clone.originalNode != node)
					{
						cleanNode(node);
					}
					else
					{
						node = node.firstChild;
						clone = clone.firstChild;
						
						while (node != null)
						{
							var nextNode = node.nextSibling;
							
							if (clone == null)
							{
								cleanNode(node);
							}
							else
							{
								checkNode(node, clone);
								clone = clone.nextSibling;
							}
	
							node = nextNode;
						}
					}
				}
			}
function checkNode ( node , clone ) { if ( node != null ) { if ( clone . originalNode != node ) { cleanNode ( node ) ; } else { node = node . firstChild ; clone = clone . firstChild ; while ( node != null ) { var nextNode = node . nextSibling ; if ( clone == null ) { cleanNode ( node ) ; } else { checkNode ( node , clone ) ; clone = clone . nextSibling ; } node = nextNode ; } } } }
Checks the given node for new nodes, recursively
Checks the given node for new nodes recursively