![\"Add](\"/i/image/help/addVertexEn.gif\")
To create a graph you need to add vertexes. Select «Add vertex» and click to the workspace.
\n\n
\n\n
To connect vertexes you need to select «Connect vertexes» and click to the first vertex and then to the second one.
\n\n![\"Connect](\"/i/image/help/addEdgeEn.gif\"/)
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.
\n\nChoose «Find shortest path» 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.
\n\n![\"Find](\"/i/image/help/findShortPathesEn.gif\")
\n"; + $g_lang["text"] = "\n
To create a graph you need to add vertices. Select «Add vertex» and click to the workspace.
\n\n
\n\n
To connect vertices you need to select «Connect vertices» and click to the first vertex and then to the second one.
\n\n
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.
\n\nChoose «Find shortest path» 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.
\n\n
\n"; $g_lang["m_title"] = "Graph Online help"; $g_lang["m_keyWords"] = "graph, help"; diff --git a/lang/en/home.php b/lang/en/home.php index a8b4921..6cb317e 100755 --- a/lang/en/home.php +++ b/lang/en/home.php @@ -3,7 +3,7 @@ $g_lang["title_notg"] = "Find shortest path"; $g_lang["text"] = "
Create graph and find the shortest path. On the Help page you will find tutorial video.
\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"; $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"; ?> diff --git a/lang/nl/home.php b/lang/nl/home.php index c893abf..f95de27 100644 --- a/lang/nl/home.php +++ b/lang/nl/home.php @@ -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"; ?> diff --git a/tpl/home.php b/tpl/home.php index db3d541..14b24f6 100755 --- a/tpl/home.php +++ b/tpl/home.php @@ -174,18 +174,18 @@ - +