<?php
    $g_lang["title_notg"] = "Vind het kortste pad";
    $g_lang["text"] = "<p>Créeer een graaf en vind het kortste pad. Op de Help pagina kunt u een <a href=\"/en/help\"> uitleg video vinden.</a>.</p>";
    $g_lang["add_node"] = "Voeg knoop toe";
    $g_lang["connect_nodes"] = "Verbind knopen";
    $g_lang["delete"] = "Verwijder object";
    $g_lang["default"] = "Standaard";
    $g_lang["short_path"] = "Vind het kortste pad";
    $g_lang["save_direction_choose"] = "Sla het wegen type op";
    $g_lang["edge_weight"] = "Gewicht van de weg";
    $g_lang["save_weight_choose"] = "Gebruik waarde voor de volgende wegen";
    $g_lang["default_weight"] = "Heeft geen gewicht";
    $g_lang["browser_no_support"] = "Uw browser wordt niet ondersteund";
    $g_lang["select_and_move_objects"] = "Selecteer en verplaats objecten met de muis of verplaats het werkgebied";
    $g_lang["move_cursor_for_moving"] = "Sleep met de muis om objecten te verplaatsen";
    $g_lang["add_graph"] = "Voeg een weg toe";
    $g_lang["orint_edge"] = "Gericht";
    $g_lang["not_orint_edge"] = "Ongericht";
    $g_lang["show_adjacency_matrix"] = "Bogenmatrix";
    $g_lang["save"] = "Bewaar";
    $g_lang["cancel"] = "Annuleer";
    $g_lang["adjacency_matrix_description"] = "Zet een bogenmatrix op. Gebruik komma \", \" als scheidingsteken";
    $g_lang["adjacency_matrix_bad_format"] = "De matrix is incorrect. Gebruik een komma \",\" als scheidingsteken. De matrix moet vierkant zijn";
    $g_lang["delete_all"] = "Alles verwijderen";
    $g_lang["click_to_add_vertex"] = "Klik op het werkgebied om een knoop toe te voegen. <span style=\"float:right;\">knoop nummer <select id=\"enumVertexsText\"></select></span>";
    $g_lang["select_first_vertext_to_connect"] = "Selecteer het start knooppunt van de weg";
    $g_lang["select_second_vertext_to_connect"] = "Selcteer het eind knooppunt van de weg";
    $g_lang["select_start_short_path_vertex"] = "Selecteer het start knooppunt van het kortste pad";
    $g_lang["select_finish_short_path_vertex"] = "Selecteer het eind knooppunt van het kortste pad";
    $g_lang["short_path_result"] = "De lengte van het kortste pad is %d";
    $g_lang["path_not_exists"] = "Er bestaat geen pad";
    $g_lang["select_object_to_delete"] = "Klik op het te verwijderen object";
    $g_lang["shortest_dist"] = "De kortse afstand is";
    $g_lang["show_incidence_matrix"] = "incidentiematrix";
    $g_lang["incidence_matrix_description"] = "Zet een incidentiematrix op. Gebruik komma \", \" als scheidingsteken";
    $g_lang["incidence_matrix_bad_format"] = "De matrix is incorrect. Gebruik een komma \",\" als scheidingsteken. De matrix moet vierkant zijn";
    $g_lang["this_is_graph_link"] = "De graaf is opgeslagen. Volg de link om het te bekijken.";
    $g_lang["share_graph_text"] = "Graph Online: Opgeslagen Graaf";
    $g_lang["share_graph_description"] = "Deel de link in Social Media";
    $g_lang["graph"] = "Graaf";
    $g_lang["save_dialog_title"] = "Graaf aan het opslaan";
    $g_lang["close_button"] = "sluiten";
    $g_lang["connected_component"] = "Vind de verbonden componenten";
    $g_lang["sick_connected_component_result"] = "Het aantal zwak verbonden componenten";
    $g_lang["connected_component_result"] = "Het aantal verbonden componenten is";
    $g_lang["new_graph"] = "Creëer een Graaf";
    $g_lang["what_do_you_think"] = "Wat vindt u van de site?";
    $g_lang["name"] = "Naam (email voor feedback)";
    $g_lang["feedback"] = "Feedback";
    $g_lang["send"] = "Versturen";
    $g_lang["write_to_us"] = "Om ons een vraag te stellen of een opmerking te plaatsen mail ons op";
    $g_lang["fix_matrix_button"] = "Corrigeer de matrix";
    $g_lang["open_matrix_help"] = "help";
    $g_lang["wrong_matrix_title"] = "Matrix heeft het verkeerde formaat";
    $g_lang["bad_adj_matrix_message"] = "Kan de graaf niet creëren. De bogenmatrix heeft het verkeerde formaat.Klik \"corrigeer matrix\" om de matrix te corrigeren of op de \"help\" knop om help te openen over het formaat van een bogenmatrix";
    $g_lang["bad_inc_matrix_message"] = "Kan de graaf niet creëren. incidentiematrix heeft het verkeerde formaat.Klik \"corrigeer matrix\" om de matrix te corrigeren of op de \"help\" knop om help te openen over het formaat van een incidentiematrix";
    $g_lang["save_image"] = "Screenshot van het werkblad";
    $g_lang["save_full_image"] = "Sla afbeelding van de graaf op";
    $g_lang["save_print_image"] = "Geprinte afbeelding van de graaf (z/w)";
    $g_lang["open_saved_image_browser"] = "Open de afbeelding in de browser";
    $g_lang["download_saved_image"] = "Download de opgeslagen afbeelding";
    $g_lang["save_image_dialog_title"] = "Sla de afbeelding van de graaf op";
    $g_lang["full_report"] = "Volledig rapport";
    $g_lang["short_report"] = "Kort rapport";
    $g_lang["find_eulerian_loop"] = "Vind Eulercircuit";
    $g_lang["has_eulerian_loop"] = "De graaf heeft een Eulercircuit";
    $g_lang["has_not_eulerian_loop"] = "De graaf heeft geen Eulercircuit";
    $g_lang["algorithms"] = "Algoritmes";
    $g_lang["processing"] = "Bezig met verwerken..";
    $g_lang["view"] = "Toon";
    $g_lang["view_keys"] = "Gebruik \"w\", \"a\", \"s\", \"d\". om te bewegen.";
    $g_lang["zoom_fit"] = "Vul venster";
    $g_lang["zoom_in"] = "Zoom in";
    $g_lang["zoom_out"] = "Zoom out";
    $g_lang["move_workspace"] = "Verplaats werkruimte";
    $g_lang["custom"] = "Eigen tekst";
    $g_lang["enter_vertex_title"] = "Voer titel in";
    $g_lang["rename_vertex"] = "Hernoem knoop";
    $g_lang["rename_text"] = "Hernoem ";
    $g_lang["m_title"] = "Creëer een graaf en vind het kortste pad of gebruik een ander algoritme";
    $g_lang["m_keyWords"] = "Online grafen, vindt de kortste route, visualisatie van de graaf, graaf gemaakt op basis van afstandsmatrix,,bogenmatrix, incidentiematrix, zoekfunctie verbonden componenten, Eulercircuits, minimaal  opspannende boom ";
    $g_lang["m_description"] = "Creëer een online graaf en gebruik een groot aantal algoritme's; Vindt de kortste route, vind de bogenmatrix, vind de minimaal opspannende boom en mweer.";
    $g_lang["current_language"] = "nl";
    $g_lang["developer_tools_title"] = "Creëer algoritme";
    $g_lang["developer_tools_text"] = "Plak uw algoritme hieronder en klik op Run";
    $g_lang["developer_tools_run"] = "Run";
    $g_lang["developer_tools_submit"] = "Verstuur naar de site";
    $g_lang["algorithm_was_sent"] = "Algoritme is verzonden";
    $g_lang["your_algorithm_was_sent"] = "Uw algoritme is verzonden om gecontroleerd te worden. Als het goed wordt bevonden, wordt het aan de site toegevoegd.";
    $g_lang["edit_weight"] = "Pas gewicht aan";
    $g_lang["group_rename"] = "Hernoem groep";
    $g_lang["enter_vertices_text_in_each_line"] = "Voeg de tekst voor elk punt op een aparte regel in.";
    $g_lang["or"] = "of";
    $g_lang["vote"] = "Stem";
    $g_lang["vote_question"] = "Welke functies zullen we het eerst toevoegen?";
    $g_lang["what_algorithm_need"] = "Schrijf ons welk soort algorimte u graag toegevoegd wilt hebben op deze website.";
    $g_lang["recommend_algorithm"] = "Aanbevolen algoritmes";
    $g_lang["what_algorithm_we_have"] = "Onze dienst onderteunt al de volgende onderdelen: <a href=\"/en/wiki/Help/FindTheShortestPath\" target=\"_blank\" style=\"text-decoration: underline\">Vindt de kortste route met  Dijkstra's algoritme</a>, <a href=\"/en/wiki/Help/AdjacencyMatrix\" target=\"_blank\" style=\"text-decoration: underline\">Adjacency matrix</a>, <a href=\"/en/wiki/Help/IncidenceMatrix\" target=\"_blank\" style=\"text-decoration: underline\">Incidence Matrix</a>.";
    $g_lang["has_eulerian_path"] = "Graaf heeft een Eulercircuit";
    $g_lang["has_not_eulerian_path"] = "Graaf heeft geen Eulercircuit";
    $g_lang["min_dist_matrix_description"] = "Matrix met minimale afstanden";
    $g_lang["graphOfMinDist"] = "Graaf met minimale afstanden";
    $g_lang["checkToSave"] = "vink aan om op te slaan";
    $g_lang["showDistMatrix"] = "Toon afstandsmatrix";
    $g_lang["distMatrixText"] = "Afstandsmatrix";
    $g_lang["selectStartVertexForMaxFlow"] = "Selecteer een bron voor de maximale flow";
    $g_lang["selectFinishVertexForMaxFlow"] = "Selecteer een uitgang voor de maximale flow";
    $g_lang["maxFlowResult"] = "Maximale flow van %2 naar  %3 is gelijk aan %1";
    $g_lang["flowNotExists"] = "Er  bestaat geen flow van %1 naar %2";
    $g_lang["sourceVertex"] = "Bron";
    $g_lang["sinkVertex"] = "Uitgang";
    $g_lang["export_graph"] = "Exporteer naar bestand";
    $g_lang["import_graph"] = "Importeer vanuit bestand";
    $g_lang["has_hamiltonian_path"] = "De graaf heeft een Hamiltionpad";
    $g_lang["has_not_hamiltonian_path"] = "De graaf heeft geen Hamiltionpad";
    $g_lang["has_hamiltonian_loop"] = "De graaf heeft een Hamiltioncircuit";
    $g_lang["has_not_hamiltonian_loop"] = "De graaf heeft geen Hamiltioncircuit";
    $g_lang["start_traversal"] = "Selecteer startpunt voor verwerking";
    $g_lang["traversal_order"] = "Verwerkingsvolgorde:";
    $g_lang["curve_edge"] = "Gebogen lijn";
    $g_lang["undo"] = "Ongedaan maken";
    $g_lang["opensource_message"] = "Ons project is nu open source. Voor meer details klik hier.";
    $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"] = "Instellingen";
    $g_lang["common_vertex_settings"] = "Standaard knopen";
    $g_lang["selected_vertex_settings"] = "Geselecteerde knopen";
    $g_lang["common_edge_settings"] = "Standaard wegen";
    $g_lang["selected_edge_settings"] = "Geselecteerde wegen";
    $g_lang["common_color"] = "Standaard kleur";
    $g_lang["stroke_color"] = "Teken kleur";
    $g_lang["stroke_size"] = "Dikte";
    $g_lang["text_color"] = "Tekst kleur";
    $g_lang["save_graph"] = "Sla de graaf op";
    $g_lang["vertex_draw_style"] = "Stijl van de knoop";
    $g_lang["text_background"] = "Tekst achtergrond";
    $g_lang["edge_draw_style"] = "Stijl van de weg";
    $g_lang["color"] = "Kleur";
    $g_lang["alpha"] = "Transparantie";
    $g_lang["background_style"] = "Background";
    $g_lang["adjacency_matrix_multigraph_description"] = "Multigraaf matrix bevat het gewicht van de minimale lijnen tussen hoekpunten";
    $g_lang["graph_is_multi_message"] = "Multigraaf ondersteunt niet alle algoritme's";
    $g_lang["graph_is_general_message"] = "";
    $g_lang["replace_edge"] = "vervang huidige";
    $g_lang["add_edge"] = "Toevoegen (multigraaf)";
    $g_lang["text_above_edge"] = "Tekst boven de lijn";
    $g_lang["select_groupe_mac"] = "Gebruik Cmd⌘ om meerdere objecten te selecteren.";
    $g_lang["select_groupe_win"] = "Gebruik Ctrl om meerdere objecten te selecteren.";
    $g_lang["drag_select_group"] = "Sleep groep";
    $g_lang["copy_select_group"] = "Kopiëer groep";
    $g_lang["remove_select_group"] = "Verwijder groep";

    $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["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
    $g_lang["vertices_degree_name"] = "Bereken hoekpunten graden";

    $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:";
?>
