mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-02-16 02:30:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added algorithm names on Dutch. Renamed vertexes.

Browse Source
This commit is contained in:
Unick Soft
2020-08-20 22:42:21 +02:00
parent 5e7d07a9aa
commit 49bd4b9f97
4 changed files with 28 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lang/en/help.php
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 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["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 vertices</a>. Select «Add vertex» and click to the workspace.</p>\n\n<p><img alt=\"Add vertices\" src=\"/i/image/help/addVertexEn.gif\" /></p>\n\n<p>&nbsp;</p>\n\n<h3>Connect vertices</h3>\n\n<p>To connect vertices you need <a href=\"http://graphonline.ru/en/\">to select «Connect vertices»</a> and click to the first vertex and then to the second one.</p>\n\n<p><img alt=\"Connect vertices 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 vertices. 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";

8
lang/en/home.php
View File

@@ -3,7 +3,7 @@
$g_lang["title_notg"] = "Find shortest path";
$g_lang["text"] = "<p>Create graph and find the shortest path. On the Help page you <a href=\"/en/help\">will find tutorial video</a>.</p>\n";
$g_lang["add_node"] = "Add vertex";
$g_lang["connect_nodes"] = "Connect vertexes";
$g_lang["connect_nodes"] = "Connect vertices";
$g_lang["delete"] = "Remove object";
$g_lang["default"] = "Drag";
$g_lang["short_path"] = "Find shortest path";
@@ -146,8 +146,8 @@
$g_lang["opensource_message"] = "Our project is now open source. More details...";
$g_lang["settings"] = "Settings";
$g_lang["common_vertex_settings"] = "Common vertexes";
$g_lang["selected_vertex_settings"] = "Selected vertexes";
$g_lang["common_vertex_settings"] = "Common vertices";
$g_lang["selected_vertex_settings"] = "Selected vertices";
$g_lang["common_edge_settings"] = "Common edges";
$g_lang["selected_edge_settings"] = "Selected edges";
@@ -198,5 +198,5 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
$g_lang["modern_graph_style_name"] = "Visualisation based on weight";
$g_lang["radius_and_diameter_name"] = "Search graph radius and diameter";
$g_lang["find_short_path_name"] = "Find shortest path using Dijkstra's algorithm";
$g_lang["vertices_degree_name"] = "Calculate vertexes degree";
$g_lang["vertices_degree_name"] = "Calculate vertices degree";
?>

32
lang/nl/home.php
View File

@@ -148,20 +148,20 @@
$g_lang["copy_select_group"] = "Kopiëer groep";
$g_lang["remove_select_group"] = "Verwijder groep";
$g_lang["bfs_name"] = "Breadth-first search";
$g_lang["coloring_name"] = "Graph coloring";
$g_lang["find_connection_component_name"] = "Find connected components";
$g_lang["dfs_name"] = "Depth-first search";
$g_lang["eulerin_loop_name"] = "Find Eulerian cycle";
$g_lang["eulerin_path_name"] = "Find Eulerian path";
$g_lang["fiold_name"] = "Floyd–Warshall algorithm";
$g_lang["graph_reorder_name"] = "Arrange the graph";
$g_lang["hamiltoian_cycle_name"] = "Find Hamiltonian cycle";
$g_lang["hamiltonian_path_name"] = "Find Hamiltonian path";
$g_lang["max_flow_name"] = "Find Maximum flow";
$g_lang["minimum_spanning_tree"] = "Search of minimum spanning tree";
$g_lang["modern_graph_style_name"] = "Visualisation based on weight";
$g_lang["radius_and_diameter_name"] = "Search graph radius and diameter";
$g_lang["find_short_path_name"] = "Find shortest path using Dijkstra's algorithm";
$g_lang["vertices_degree_name"] = "Calculate vertexes degree";
$g_lang["bfs_name"] = "Breedte-eerste zoekopdracht";
$g_lang["coloring_name"] = "Grafiekkleuring";
$g_lang["find_connection_component_name"] = "Vind aangesloten componenten";
$g_lang["dfs_name"] = "Diepte eerst zoeken";
$g_lang["eulerin_loop_name"] = "Zoek de euleriaanse cyclus";
$g_lang["eulerin_path_name"] = "Zoek het euleriaanse pad";
$g_lang["fiold_name"] = "Floyd-Warshall-algoritme";
$g_lang["graph_reorder_name"] = "Schik de grafiek";
$g_lang["hamiltoian_cycle_name"] = "Vind Hamiltoniaanse cyclus";
$g_lang["hamiltonian_path_name"] = "Vind Hamiltoniaans pad";
$g_lang["max_flow_name"] = "Vind maximale stroom";
$g_lang["minimum_spanning_tree"] = "Zoeken naar minimaal opspannende boom";
$g_lang["modern_graph_style_name"] = "Visualisatie op basis van gewicht";
$g_lang["radius_and_diameter_name"] = "Zoek grafiek straal en diameter";
$g_lang["find_short_path_name"] = "Kortstepad-algoritme (Dijkstra's algoritme)";
$g_lang["vertices_degree_name"] = "Bereken hoekpunten graden";
?>

12
tpl/home.php
View File

@@ -174,18 +174,18 @@
</div>
</a>
</section>
<? elseif (L('current_language') == "nl"): ?>
<? elseif (L('current_language') == "en"): ?>
<section style="height:32px;text-align: center;" id="bottom_info" class="hidden-phone">
<a class="ProgresssBarLink" href="https://docs.google.com/spreadsheets/d/1wAhHJ1GrPp_uyZ9MMH4JSZaGnlMvfwZs7G861Y24MQA/edit?usp=sharing" target="_blank">
<a class="ProgresssBarLink" href="https://docs.google.com/spreadsheets/d/154wpW8e7DonWJoYnXPDuyECM38UFyFX_WLT1y_UZPck/edit#gid=0" target="_blank">
<div class="ProgressBar" style="height:32px">
<div class="ProgressBarFill" style="width:0%;"></div>
<span class="ProgressBarText" style="top:-28px">You may help with translation algorithm names to Dutch</span>
<span class="ProgressBarText" style="top:-28px">You may help us with translation to German</span>
</div>
</a>
</section>
<? elseif (true || L('current_language') != "en"): ?>
<? elseif (false && L('current_language') != "en"): ?>
<section style="height:32px;text-align: center;" id="bottom_info" class="hidden-phone">
<a class="ProgresssBarLink" href="opensource" target="_blank">
@@ -199,10 +199,12 @@
<? else: ?>
<section style="height:32px;text-align: center;" id="bottom_info" class="hidden-phone">
<a class="ProgresssBarLink" href="opensource" target="_blank">
<div class="ProgressBar" style="height:32px">
<div class="ProgressBarFill" style="width:0%;"></div>
<span class="ProgressBarText" style="top:-28px"><p><?= L('greek_add')?></p></span>
<span class="ProgressBarText" style="top:-28px"><p><?= L('opensource_message')?></p></span>
</div>
</a>
</section>
<? endif; ?>