var fDesc=new Array();
fDesc[0] = "Graph Magics is an Ultimate tool for graph theory. Containing a numerous collection of functions and utilities it offers you the possibility of easy, fast and efficient construction and modification of graphs. Some of the best things of this program are the graph generator tool and the possibility to process 17 different algorithms on graphs (Shortest Path, Minimal Spanning Tree, Maximum Flow, Minimum Cut, Eulerian and Hamiltonian Paths, Chinese Postman Problem, Maximal Subset of Independent Vertices, Maximum Clique and others).Graph Magics may be used for many different purposes: graph construction, solving problems, learning and teaching subjects related to graph theory etc.";

function tShowHide(id, show)
{
	var s = document.getElementById("desc");

	if ((s.innerHTML.length<=212 || show==1) && show!=2)
	{
		s.innerHTML = fDesc[id];
		if (document.getElementById('m1'))
			document.getElementById('m1').style.display='none';
		if (document.getElementById('m2'))
			document.getElementById('m2').style.display='none';
		if (document.getElementById('more_txt'))
			document.getElementById('more_txt').style.display='inline';
	}
	else
	{
		s.innerHTML = '';
	}
}