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

Add Es algorithms names. Added link to translate to Portuguese

Browse Source
This commit is contained in:
Unick Soft
2020-08-30 13:00:21 +02:00
parent 49bd4b9f97
commit ca1733d7ff
2 changed files with 19 additions and 41 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
lang/es/home.php
View File

@@ -183,20 +183,20 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
$g_lang["copy_select_group"] = "Copiar grupo";
$g_lang["remove_select_group"] = "Borrar grupo";
$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"] = "Búsqueda en anchura (BFS)";
$g_lang["coloring_name"] = "Coloración de grafo";
$g_lang["find_connection_component_name"] = "Encontrar componentes conectado";
$g_lang["dfs_name"] = "Búsqueda en profundidad (DFS)";
$g_lang["eulerin_loop_name"] = "Encotrar ciclo euleriano";
$g_lang["eulerin_path_name"] = "Encontrar camino euleriano";
$g_lang["fiold_name"] = "Algoritmo de Floyd-Warshall";
$g_lang["graph_reorder_name"] = "Organizar el gráfico";
$g_lang["hamiltoian_cycle_name"] = "Encontrar ciclo hamiltoniano";
$g_lang["hamiltonian_path_name"] = "Encontrar camino hamiltoniano";
$g_lang["max_flow_name"] = "Encuentra el flujo máximo";
$g_lang["minimum_spanning_tree"] = "Búsqueda de árbol de expansión mínimo";
$g_lang["modern_graph_style_name"] = "Visualización basada en el peso";
$g_lang["radius_and_diameter_name"] = "Buscar radio y diámetro del grafo";
$g_lang["find_short_path_name"] = "Encontrar el camino más corto usando el algoritmo de Dijkstra";
$g_lang["vertices_degree_name"] = "Calcular grado de los vértices";
?>