mirror of
https://github.com/UnickSoft/graphonline.git
synced 2025-07-01 23:36:00 +00:00
9 lines
1.4 KiB
PHP
Executable File
9 lines
1.4 KiB
PHP
Executable File
<?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 «Add vertex» and click to workspace</p>\n\n<p><img alt=\"Add vertexes\" src=\"/i/image/help/addVertexEn.gif\" /></p>\n\n<p> </p>\n\n<h3>Connect vertex</h3>\n\n<p>To connect vertexes you need<a href=\"http://graphonline.ru/en/\">select "Connect vertexes"</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 "Find shortest path"</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> </p>\n";
|
|
|
|
$g_lang["m_title"] = "Graph Online help";
|
|
$g_lang["m_keyWords"] = "graph, help";
|
|
$g_lang["m_description"] = "Graph online help page";
|
|
?>
|