<?php

    $g_lang["title_notg"] = "Encontrar camino más corto";
    $g_lang["text"] = "<p>Crea un grafo y encuentra el camino más corto entre vértices. En la página de ayuda <a href=\"/en/help\">encontrarás un video tutorial</a>.</p>\n";
    $g_lang["add_node"] = "Agregar vértice";
    $g_lang["connect_nodes"] = "Conectar vértices";
    $g_lang["delete"] = "Remover objeto";
    $g_lang["default"] = "Arrastrar";
    $g_lang["short_path"] = "Encontrar camino más corto";
    $g_lang["save_direction_choose"] = "Save edge type";
    $g_lang["edge_weight"] = "Peso de arista";
    $g_lang["save_weight_choose"] = "Usar valor para las próximas aristas";
    $g_lang["default_weight"] = "No tiene peso";
    $g_lang["browser_no_support"] = "Tu navegador no está soportado";
    $g_lang["select_and_move_objects"] = "Selecciona y mueve objetos con el mouse o mueve el espacio de trabajo.";
    $g_lang["move_cursor_for_moving"] = "Arrastra el cursor para mover objetos";
    $g_lang["add_graph"] = "Agregar arista";
    $g_lang["orint_edge"] = "Dirigido";
    $g_lang["not_orint_edge"] = "No Dirigido";
    $g_lang["show_adjacency_matrix"] = "Matriz de Adyacencia";
    $g_lang["save"] = "Guardar";
    $g_lang["cancel"] = "Cancelar";
    $g_lang["adjacency_matrix_description"] = "Configurar matriz de adyacencia. Usar coma \",\" como separador";
    $g_lang["adjacency_matrix_bad_format"] = "La matriz ez incorrecta. Usar coma \",\" como separador. Matrix should be square";
    $g_lang["delete_all"] = "Remover todos";    
    $g_lang["click_to_add_vertex"] = "Clickea el espacio de trabajo para agregar un vértice. <span style=\"float:right;\">Enumeración de vértives"  .
    "<select id=\"enumVertexsText\">" .
    "</select></span>";
    $g_lang["select_first_vertext_to_connect"] = "Seleccionar primer vértice de la arista";
    $g_lang["select_second_vertext_to_connect"] = "Seleccionar segundo vértice de la arista";
    $g_lang["select_start_short_path_vertex"] = "Seleccionar vértice inicial del camino más corto";
    $g_lang["select_finish_short_path_vertex"] = "Seleccionar vértice final del camino más corto";
    $g_lang["short_path_result"] = "La longitud del camino más corto es %d";
    $g_lang["path_not_exists"] = "No existe un camino";
    $g_lang["select_object_to_delete"] = "Clickea el objeto a remover";
    $g_lang["shortest_dist"] = "La distancia más corta es ";
    $g_lang["show_incidence_matrix"] = "Matriz de incidencia";
    $g_lang["incidence_matrix_description"] = "Configurar matriz de incidencia. Usar coma \",\" como separador.";
    $g_lang["incidence_matrix_bad_format"] = "La matriz es incorrecta. Usar coma \",\" como separador.";
    $g_lang["this_is_graph_link"] = "El grafo fue guardado. Sigue este enlace para verlo.";
    $g_lang["share_graph_text"] = "Graph Online: Guardar Grafo";
    $g_lang["share_graph_description"] = "Comparte el enlace en las redes sociales:";
    $g_lang["graph"] = "Grafo";
    $g_lang["save_dialog_title"] = "Guardando Grafo";
    $g_lang["close_button"] = "Cerrar";
    $g_lang["connected_component"] = "Encontrar componentes conexas";
    $g_lang["sick_connected_component_result"] = "El número de componentes débilmente conexas es ";
    $g_lang["connected_component_result"] = "El número de componentes conexas es ";
    $g_lang["new_graph"] = "Crear grafo";
    $g_lang["what_do_you_think"] = "¿Que piensas acerca del sitio?";
    $g_lang["name"] = "Nombre (email sugerencias)";
    $g_lang["feedback"] = "Sugerencias";
    $g_lang["send"] = "Enviar";
    $g_lang["write_to_us"] = "Para hacernos una pregunta o enviarnos un comentario, escribenos a ";
    $g_lang["fix_matrix_button"] = "Arreglar matriz";
    $g_lang["open_matrix_help"] = "Ayuda";
    $g_lang["wrong_matrix_title"] = "La matriz tiene un formato erróneo";
    $g_lang["bad_adj_matrix_message"] = "No se puede crear el grafo. La matriz de adyacencia tiene un formato erróneo. Clickea el botón \"Arreglar matriz\" para arreglar la matriz o el botón \"Ayuda\" para abrir la ayuda sobre el formato de la matriz de adyacencia";
    $g_lang["bad_inc_matrix_message"] = "No se puede crear el grafo. La matriz de incidencia tiene un formato erróneo. Clickea el botón \"Arreglar matriz\" para arreglar la matriz o el botón \"Ayuda\" para abrir la ayuda sobre el formato de la matriz de incidencia";
    $g_lang["save_image"] = "Captura de pantalla del espacio de trabajo";
    $g_lang["save_full_image"] = "Guardar imagen del grafo";
    $g_lang["save_print_image"] = "Imagen impresa del grafo (blanco y negro)";
    $g_lang["open_saved_image_browser"] = "Abrir imagen en navegador";
    $g_lang["download_saved_image"] = "Descargar imagen guardada";
    $g_lang["save_image_dialog_title"] = "Guardar imagen del grafo";
    $g_lang["full_report"] = "Reporte completo";
    $g_lang["short_report"] = "Reporte resumido";
    $g_lang["find_eulerian_loop"] = "Encontrar ciclo euleriano";
    $g_lang["has_eulerian_loop"] = "El grafo tiene un ciclo euleriano";
    $g_lang["has_not_eulerian_loop"] = "El grafo tiene no un ciclo euleriano";
    $g_lang["algorithms"] = "Algoritmos";
    $g_lang["processing"] = "Procesando...";
    $g_lang["view"] = "Vista";
    $g_lang["view_keys"] = "Para mover usa las teclas \"w\", \"a\", \"s\", \"d\".";
    $g_lang["zoom_fit"] = "Ajuste de Zoom";
    $g_lang["zoom_in"] = "Zoom in";
    $g_lang["zoom_out"] = "Zoom out";
    $g_lang["move_workspace"] = "Mover espacio de trabajo";
    $g_lang["custom"] = "Texto personalizado";
    $g_lang["enter_vertex_title"] = "Ingresar título";
    $g_lang["rename_vertex"] = "Renombrar vértice";
    $g_lang["rename_text"] = "Renombrar";

    $g_lang["m_title"] = "Crea un grafo en línea y encuentra caminos más cortos entre vértices o usa otros algoritmos";
    $g_lang["m_keyWords"] = "grafo en linea, encontrar camino más corto, visualización de grafos, grafo a partir de matriz de adyacencia, matriz de adyacencia, matriz de incidencia, buscar componentes conexas, ciclo euleriano, árbol recubridor mínimo";
    $g_lang["m_description"] = "Crea un grafo en línea y usa muchos algoritmos: encontrar el camino más corto entre vérties, armar matriz de adyacencia, encontrar árbol recubridor mínimo y otros";
    $g_lang["current_language"] = "es";
    
    
    $g_lang["developer_tools_title"] = "Crear algoritmo";
    $g_lang["developer_tools_text"] = "Pega tu algoritmo debajo y presiona Correr";
    $g_lang["developer_tools_run"] = "Correr";
    
    $g_lang["developer_tools_submit"] = "Enviar al sitio";
    
    $g_lang["algorithm_was_sent"] = "El algoritmo fue enviado";
    $g_lang["your_algorithm_was_sent"] = "Tu algoritmo fue enviado para verificación y en caso de que sea correcto será agregado al sitio.";
    
    $g_lang["edit_weight"] = "Editar peso";
    
    $g_lang["group_rename"] = "Renombrar grupo";
    $g_lang["enter_vertices_text_in_each_line"] = "Ingresa texto para cada vértice en una línea separada";
    $g_lang["or"] = "o";
    $g_lang["vote"] = "Votar";
    $g_lang["vote_question"] = "¿Que funciones deberíamos agregar primero?";

    $g_lang["what_algorithm_need"] = "¿Por favor, escribe que clase de algoritmo te gustaría ver en este sitio web?";

    $g_lang["recommend_algorithm"] = "Recomendar algoritmos";

    $g_lang["what_algorithm_we_have"] = "Nuestro servicio ya cuenta con las siguientes funciones: <a href=\"/en/wiki/Help/FindTheShortestPath\" target=\"_blank\" style=\"text-decoration: underline\">Encontrar el camino más corto usando el algoritmo de Dijkstra</a>, <a href=\"/en/wiki/Help/AdjacencyMatrix\" target=\"_blank\" style=\"text-decoration: underline\">Matriz de adyacencia</a>, <a href=\"/en/wiki/Help/IncidenceMatrix\" target=\"_blank\" style=\"text-decoration: underline\">>Matriz de incidencia</a>.";

    $g_lang["has_eulerian_path"]     = "El grafo grafo tiene un camino euleriano";
    $g_lang["has_not_eulerian_path"] = "El grafo grafo no tiene un camino euleriano";

    $g_lang["min_dist_matrix_description"] = "Matriz de distancias mínimas";
    
    $g_lang["graphOfMinDist"] = "Grafo de distancias mínimas";
    $g_lang["checkToSave"]    = "Checkea para guardar";
    $g_lang["showDistMatrix"] = "Mostrar matriz de distancias";
    $g_lang["distMatrixText"] = "Matriz de distancias";
    
    $g_lang["selectStartVertexForMaxFlow"]   = "Selecciona una fuente para el flujo máximo";
    $g_lang["selectFinishVertexForMaxFlow"]  = "Selecciona un sumidero para el flujo máximo";
    $g_lang["maxFlowResult"]  = "El flujo máximo de %2 a %3 es igual %1";
    $g_lang["flowNotExists"]  = "El flujo de %1 a %2 no existe";

    $g_lang["sourceVertex"]  = "Fuente";
    $g_lang["sinkVertex"]    = "Sumidero";

    $g_lang["export_graph"]    = "Exportar a archivo";
    $g_lang["import_graph"]    = "Importar desde archivo";

    $g_lang["has_hamiltonian_path"] = "El grafo grafo tiene un camino hamiltoniano";
    $g_lang["has_not_hamiltonian_path"] = "El grafo grafo no tiene un camino hamiltoniano";

    $g_lang["has_hamiltonian_loop"] = "El grafo grafo tiene un ciclo hamiltoniano";
    $g_lang["has_not_hamiltonian_loop"] = "El grafo grafo no tiene un ciclo hamiltoniano";

    $g_lang["start_traversal"]  = "Selecciona vértice de inicio de recorrido";
    $g_lang["traversal_order"]  = "Orden de recorrido: ";

    $g_lang["curve_edge"]       = "Doblar arista";
    $g_lang["undo"]             = "Deshacer";

    $g_lang["opensource_message"] = "Nuestro proyecto es ahora de código abierto. Más detalles...";

    $g_lang["we_are_improving"] = "We are improving Graphonline, if you faced with any problem please let us know: admin@graphonline.ru";

    $g_lang["settings"] = "Opciones";
    $g_lang["common_vertex_settings"]   = "Vértices comunes";
    $g_lang["selected_vertex_settings"] = "Vértices seleccionados";
    $g_lang["common_edge_settings"]     = "Aristas comunes";
    $g_lang["selected_edge_settings"]   = "Aristas seleccionadas";

    $g_lang["common_color"] = "Color común";
    $g_lang["stroke_color"] = "Color del trazo";
    $g_lang["stroke_size"]  = "Grosor";
    $g_lang["text_color"]   = "Color del texto";
    $g_lang["save_graph"]   = "Guardar grafo";
    $g_lang["default"]      = "Default";
    $g_lang["vertex_draw_style"] = "Estilo de vértice";
    $g_lang["text_background"]   = "Fondo de texto";
    $g_lang["edge_draw_style"]   = "Estilo de arista";

    $g_lang["color"] = "Color";
    $g_lang["alpha"] = "Opacidad";

    $g_lang["background_style"] = "Background";

    $g_lang["adjacency_matrix_multigraph_description"] = "Las matrices de multigrafos continen el mínimo de los pesos de las aristas que unen los vértices.";

    $g_lang["graph_is_multi_message"]   = "Los multigrafos no soportan todos los algoritmos";
    $g_lang["graph_is_general_message"] = "";

    $g_lang["replace_edge"] = "Reemplazar actual";
    $g_lang["add_edge"] = "Agregar (multigrafo)";
    $g_lang["greek_add"] = "<a class=\"ProgresssBarLink\" href=\"/el/\" target=\"_blank\">
Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickSoft/graphonline/pull/4\" target=\"_blank\">Gracias KyriakosG78</a>";
    $g_lang["text_above_edge"] = "Textos sobre arista";

    $g_lang["select_groupe_mac"] = "Usa Cmd⌘ para seleccionar varios objetos.";
    $g_lang["select_groupe_win"] = "Usa Ctrl para seleccionar varios objetos.";
    $g_lang["drag_select_group"] = "Arrastrar grupo.";
    $g_lang["copy_select_group"] = "Copiar grupo";
    $g_lang["remove_select_group"] = "Borrar grupo";

    $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
    $g_lang["vertices_degree_name"] = "Calcular grado de los vértices";

    $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
    $g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
    $g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";

    // IsomorphismCheck.js
    $g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
    $g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
    $g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
    $g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
    $g_lang['graphs_isomorph'] = "Graphs are isomorphic";
    $g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
    $g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
    $g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
    $g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
    $g_lang['subgraph_no'] = "Isomorphic subgraph # ";
    $g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
    $g_lang['isomorphism_check'] = "Check Graphs Isomorphism<sub>beta</sup>";

    // RadiusAndDiameter.js
    $g_lang['graph_is_disconnected'] = "Graph is disconnected";    
    $g_lang['graph_is_trivial'] = "Graph contains only one vertex";
    $g_lang['graph_radius'] = "Graph radius";
    $g_lang['graph_diameter'] = "Graph diameter";
    $g_lang['vertex_central'] = "Central";
    $g_lang['vertex_peripheral'] = "Peripheral";

    // VerticesDegree.js
    $g_lang['maximum_degree_of_graph'] = "The maximum degree of a graph is";

    // Coloring.js
    $g_lang['color_number'] = "Color number is";

    $g_lang['done'] = "Done";

    $g_lang['action'] = "Actions";
    $g_lang['common_edge_style'] = "Common edge style";
    $g_lang['selected_edge_style'] = "Selected edge style";
    $g_lang['common_vertex_style'] = "Common vertex style";
    $g_lang['selected_vertex_style'] = "Selected vertex style";

    $g_lang['shape'] = "Shape";
    $g_lang['circle'] = "Circle";
    $g_lang['squere'] = "Square";
    $g_lang['triangle'] = "Triangle";
    $g_lang['pentagon'] = "Pentagon";
    $g_lang['textbox'] = "Textbox";
    $g_lang['vertex_diameter'] = "Vertex size";

    $g_lang['additional_text_color'] = "Another text color"; 
    $g_lang['center'] = "Center";
    $g_lang['on_up'] = "Above";
    
    $g_lang['weight_position'] = "Weight position";    
    $g_lang['text_position'] = "Text position";
    $g_lang['line_style']    = "Edge style";
    $g_lang['edge_width']    = "Edge width";
    $g_lang['selected_index'] = "Selection group";

    $g_lang['all'] = "All";    

    //FindAllPatches.js
    $g_lang['find_all_pathes'] = "Find all paths";
    $g_lang['number_of_pathes_from'] = "Number of paths from ";
    $g_lang['to'] = " to ";
    $g_lang['are'] = " is ";
    $g_lang['path_n'] = "Path #";
    $g_lang['selected_finish_vertex'] = "Select finish vertex";
    $g_lang['selected_start_vertex'] = "Select start vertex";   
    
    // FindShortPatchsFromOne.js
    $g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
    $g_lang['distance_from'] = "Distance from ";
    $g_lang['path_to'] = "Path to ";
    
    $g_lang['search_pathes']    = "Search paths";
    $g_lang['other_algorithms'] = "Other algorithms";    

    $g_lang['use_context_menu'] = "Use context menu for additional actions.";

    $g_lang['find_longest_path'] = "Find the longest path";
    $g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
    
    $g_lang['additionl_actions'] = "Special actions";
    $g_lang['reverse_all_edges'] = "Reverse all edges";
    $g_lang['make_all_undirected'] = "Make all edges undirected";
    $g_lang['make_all_directed'] = "Make all edges directed";    

    $g_lang['save_svg_image'] = "Save graph to SVG";  

    $g_lang["bad_inc_pair_message"] = "Cannot create graph. Edge list has wrong format. Click \"fix\" button to fix edge list or \"help\" button to open help about format";
    $g_lang["edge_list_wrong_format"] = "Edge list format is incorrect";
    $g_lang["fix_button"] = "fix";

    $g_lang["snowflake"] = "Snowflake";
    
    $g_lang["save_edge_for_future"] = "Save edge to reuse in the future";    
    $g_lang["reuse_saved_edge"] = "Reuse saved edge";       

    $g_lang["max_clique"] = "Max Clique";
    $g_lang["max_clique_not_found"] = "Max Clique is not found";
    $g_lang["max_clique_size_is"] = "Max Clique size is ";
    $g_lang["max_clique_contains"] = ". Clique contains these vertecies: ";    

    $g_lang["remove_background_image"] = "Remove background image";
    $g_lang["upload"] = "Upload";
    $g_lang["background_image"] = "Background image";

    $g_lang['wrong_image_background_format'] = "Wrong image format. Only JPEG and PNG are supported";
    $g_lang['wrong_image_background_size'] = "Image size is too big. Image size must be less than {0} pixels.";
    
    $g_lang['text_size'] = "Text size";

    $g_lang['you_have_autosave'] = "You have autosave for this graph.";
    $g_lang['load_oiginal_or_autosaved'] = "Would you like to load original graph or autosaved graph?";
    $g_lang['use_mouse_for_moving'] = "Use🖱️for moving";
    $g_lang['original_graph'] = "Original graph";
    $g_lang['autosaved_graph'] = "Autosaved graph";

    $g_lang['open_last_used_graph'] = "Open Recent Graph";

    $g_lang['vertex_name_place_holder'] = "vertex name";

    $g_lang["max_independent_set"] = "Max Independent Set";
    $g_lang["max_independent_set_not_found"] = "Max Independent Set is not found";
    $g_lang["max_independent_set_size_is"] = "Max Independent Set size is ";
    $g_lang["max_independent_set_contains"] = ". Set contains these vertecies: ";

    $g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
    $g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
    $g_lang['length_is'] = "length is ";

    $g_lang['graph_is_to_large'] = "The graph is too large for this algorithm (<span id=\"current_graph_size\">X</span> vertices, <span id=\"current_edge_number\">X</span> edges).";
    $g_lang['algorith_supports_max_limit'] = "The algorithm supports graphs of size no larger than <span id=\"algorithm_max_limit\">X</span> vertices and <span id=\"algorithm_edge_limit\">X</span> edges.";
    $g_lang['error'] = "Error";

    $g_lang['salesman_problem'] = "Salesman Problem";
    $g_lang['no_solution'] = "The solution doesn't exist";
    $g_lang['shortest_loop_is'] = "The length of shortest possible loop is ";
    $g_lang['salesman_path_problem'] = "Salesman Path Problem";
    $g_lang['shortest_path_is'] = "The length of shortest path is ";

    $g_lang['default_style'] = "Default";
    $g_lang['night_style'] = "Night";
    $g_lang['large_high_contrast_style'] = "Large High Contrast";
    $g_lang['styles'] = "Styles";

    $g_lang['this_is_graph_image_link'] = "The image is saved and will be available at the following link:";
?>
