Fixed english quick help

This commit is contained in:
Unick Soft 2017-07-04 22:18:00 +03:00
parent 355c062230
commit 6f58737160

View File

@ -1,7 +1,7 @@
<?php
$g_lang["title_notg"] = "Graph Online Help";
$g_lang["text"] = "<p><iframe allowfullscreen=\"\" frameborder=\"0\" height=\"315\" src=\"//www.youtube.com/embed/Sx4tOe3bWNg\" width=\"560\"></iframe></p>\n<h3>Add vertex</h3>\n\n<p>To create graph you need<a href=\"http://graphonline.ru/en/\">to vertexes</a>. Select &laquo;Add vertex&raquo; and click to workspace</p>\n\n<p><img alt=\"Add vertexes\" src=\"/i/image/help/addVertexEn.gif\" /></p>\n\n<p>&nbsp;</p>\n\n<h3>Connect vertex</h3>\n\n<p>To connect vertexes you need<a href=\"http://graphonline.ru/en/\">select &quot;Connect vertexes&quot;</a> and click to first vertex after that to second.</p>\n\n<p><img alt=\"Connect vertexes Graph Online\" src=\"/i/image/help/addEdgeEn.gif\"/></p>\n\n<p>In dialog you need to select weight or stay it without weight, also choose type: directed or not.</p>\n\n<h3>Find shortest path</h3>\n\n<p>Choose <a href=\"http://graphonline.ru/en/\">menu &quot;Find shortest path&quot;</a>. After that select start and finish vertexes. If there us path you will see it on the graph. We use dijkstra's algorithm.</p>\n\n<p><img alt=\"Find shortest path on graph\" src=\"/i/image/help/findShortPathesEn.gif\" /></p>\n\n<p>&nbsp;</p>\n";
$g_lang["text"] = "<p><iframe allowfullscreen=\"\" frameborder=\"0\" height=\"315\" src=\"//www.youtube.com/embed/Sx4tOe3bWNg\" width=\"560\"></iframe></p>\n<h3>Add vertex</h3>\n\n<p>To create a graph you need <a href=\"http://graphonline.ru/en/\">to add vertexes</a>. Select «Add vertex» and click to the workspace.</p>\n\n<p><img alt=\"Add vertexes\" src=\"/i/image/help/addVertexEn.gif\" /></p>\n\n<p>&nbsp;</p>\n\n<h3>Connect vertexes</h3>\n\n<p>To connect vertexes you need <a href=\"http://graphonline.ru/en/\">to select «Connect vertexes»</a> and click to the first vertex and then to the second one.</p>\n\n<p><img alt=\"Connect vertexes Graph Online\" src=\"/i/image/help/addEdgeEn.gif\"/></p>\n\n<p>In the dialog box you need to select weight or leave it without weight. You may also choose the type of the graph, i.e. directed or undirected. </p>\n\n<h3>Find shortest path</h3>\n\n<p>Choose <a href=\"http://graphonline.ru/en/\">«Find shortest path»</a> in the dropdown menu. After that select start and end vertexes. If there is a path, you will see it on the graph. We use Dijkstra's algorithm.</p>\n\n<p><img alt=\"Find shortest path on graph\" src=\"/i/image/help/findShortPathesEn.gif\" /></p>\n\n<p>&nbsp;</p>\n";
$g_lang["m_title"] = "Graph Online help";
$g_lang["m_keyWords"] = "graph, help";