<?php

    $g_lang["title_notg"] = "Hitta den kortaste vägen";
    $g_lang["text"] = "<p> Skapa graf och hitta den kortaste vägen. På Hjälpsidan <a href=\"/sv/help\"> hittar du självstudievideo </a>. </p>";
    $g_lang["add_node"] = "Lägga till en nod";
    $g_lang["connect_nodes"] = "Ansluta noder";
    $g_lang["delete"] = "Ta bort ";
    $g_lang["default"] = "Standard";
    $g_lang["short_path"] = "Hitta den kortaste vägen";
    $g_lang["save_direction_choose"] = "Spara kanttyp (riktad eller inte)";
    $g_lang["edge_weight"] = "Kantvikt";
    $g_lang["save_weight_choose"] = "använda värde för nästa kanter";
    $g_lang["default_weight"] = "har ingen vikt";
    $g_lang["browser_no_support"] = "Din webbläsare stöds inte";
    $g_lang["select_and_move_objects"] = "Välj och flytta objekt med mus eller flytta arbetsytan";
    $g_lang["move_cursor_for_moving"] = "Dra pekaren för att flytta objekt";
    $g_lang["add_graph"] = "Lägg till kant";
    $g_lang["orint_edge"] = "Riktad";
    $g_lang["not_orint_edge"] = "Oriktad";
    $g_lang["show_adjacency_matrix"] = "Grannmatris";
    $g_lang["save"] = "Spara";
    $g_lang["cancel"] = "Annullera";
    $g_lang["adjacency_matrix_description"] = "Ställ in grannmatris. Använd komma \",\" som separator";
    $g_lang["adjacency_matrix_bad_format"] = "Matrisen är felaktig. Använd komma \",\" som separator. Matrisen ska vara kvadratisk";
    $g_lang["delete_all"] = "Ta bort allt";
    $g_lang["click_to_add_vertex"] = "Klicka på arbetsytan för att lägga till en ny nod. <span style=\"float: right;\"> Noduppräkning <select id=\"enumVertexsText\"> </select> </span>
    ";
    $g_lang["select_first_vertext_to_connect"] = "Välj första kantens nod";
    $g_lang["select_second_vertext_to_connect"] = "Välj den andra kantens nod";
    $g_lang["select_start_short_path_vertex"] = "Välj den första noden för den kortaste vägen";
    $g_lang["select_finish_short_path_vertex"] = "Välj slutnoden på den kortaste vägen";
    $g_lang["short_path_result"] = "Kortaste väglängd är %d";
    $g_lang["path_not_exists"] = "Vägen finns inte";
    $g_lang["select_object_to_delete"] = "Klicka på objektet för att ta bort";
    $g_lang["shortest_dist"] = "det lägsta avståndet är =";
    $g_lang["show_incidence_matrix"] = "Incidensmatris";
    $g_lang["incidence_matrix_description"] = "Ställ in incidensmatris. Använd komma \",\" som separator.";
    $g_lang["incidence_matrix_bad_format"] = "Matrisen är felaktig. Använd komma \",\" som separator.";
    $g_lang["this_is_graph_link"] = "Grafen var sparad. Följ den här linken för att se den.";
    $g_lang["share_graph_text"] = "Graph Online: Sparad graf";
    $g_lang["share_graph_description"] = "Dela länk i sociala nätverk:";
    $g_lang["graph"] = "Graf";
    $g_lang["save_dialog_title"] = "Att spara graf";
    $g_lang["close_button"] = "avsluta";
    $g_lang["connected_component"] = "Hitta anslutna komponenter";
    $g_lang["sick_connected_component_result"] = "Antalet av svagt anslutna komponenter är";
    $g_lang["connected_component_result"] = "Antalet av anslutna komponenter är";
    $g_lang["new_graph"] = "Skapa graf";
    $g_lang["what_do_you_think"] = "Vad tycker du om webbsidan?";
    $g_lang["name"] = "Namn (email för feedback)";
    $g_lang["feedback"] = "Feedback";
    $g_lang["send"] = "Skicka";
    $g_lang["write_to_us"] = "för att ställa oss en fråga eller skicka en kommentar, skriv oss på";
    $g_lang["fix_matrix_button"] = "fixa matris";
    $g_lang["open_matrix_help"] = "hjälp";
    $g_lang["wrong_matrix_title"] = "Matrisen har fel format";
    $g_lang["bad_adj_matrix_message"] = "Det går inte att skapa en graf. En grannmatris har fel format. Klicka på \"fixa matrix\", en knapp för att fixa matris eller \"hjälp\", en knapp för att öppna hjälp om format av grannmatris";
    $g_lang["bad_inc_matrix_message"] = "Det går inte att skapa en graf. Insidensmatris har fel format. Klicka på \"fixa matrix\", en knapp för att fixa matrix eller \"hjälp\", en knapp för att öppna hjälp om format av insidensmatris.";
    $g_lang["save_image"] = "Arbetsyta skärmdump";
    $g_lang["save_full_image"] = "Spara bilden av en graf";
    $g_lang["save_print_image"] = "Tryckt bild av graf (svart och vitt)";
    $g_lang["open_saved_image_browser"] = "Öppna en bild i webbläsaren";
    $g_lang["download_saved_image"] = "Ladda ner sparad bild";
    $g_lang["save_image_dialog_title"] = "Spara Bilden av en Graf";
    $g_lang["full_report"] = "Fullständig rapport";
    $g_lang["short_report"] = "Kort rapport";
    $g_lang["find_eulerian_loop"] = "Hitta Eulercykel";
    $g_lang["has_eulerian_loop"] = "Grafen har Eulerkcykel";
    $g_lang["has_not_eulerian_loop"] = "Grafen har inte Eulercykel";
    $g_lang["algorithms"] = "Algoritmer";
    $g_lang["processing"] = "Bearbetning ...";
    $g_lang["view"] = "Vy";
    $g_lang["view_keys"] = "För att flytta använder tangenterna \"w\", \"a\", \"s\", \"d\".
    ";
    $g_lang["zoom_fit"] = "Zooma passar";
    $g_lang["zoom_in"] = "Zooma in";
    $g_lang["zoom_out"] = "Zooma ut";
    $g_lang["move_workspace"] = "Flytta arbetsytan";
    $g_lang["custom"] = "Anpassad text";
    $g_lang["enter_vertex_title"] = "Ange text";
    $g_lang["rename_vertex"] = "Byt namn på nod";
    $g_lang["rename_text"] = "Byt namn ";
    $g_lang["m_title"] = "Skapa graf online och hitta kortaste väg eller använd annan algoritm";
    $g_lang["m_keyWords"] = "graf online, hitta kortaste väg, grafvisualisering, graf efter grannmatris, grannmatris, incidensmatris, sökansluten komponent, Eulercykel, minimalt spännande träd
    ";
    $g_lang["m_description"] = "Skapa graf online och använd stora mängder av algoritmer: hitta den kortaste vägen, hitta grannmatris, hitta minimalt spännträd osv.";
    $g_lang["current_language"] = "sv";
    $g_lang["developer_tools_title"] = "Skapa algoritm";
    $g_lang["developer_tools_text"] = "Klistra in din algoritm nedan och tryck på \"Kör\"";
    $g_lang["developer_tools_run"] = "Kör";
    $g_lang["developer_tools_submit"] = "Skicka till webbsidan";
    $g_lang["algorithm_was_sent"] = "Algoritmen var skickad";
    $g_lang["your_algorithm_was_sent"] = "Din algoritm var skickad för att kontrollera och i framgång kommer den att läggas till på webbsidan.";
    $g_lang["edit_weight"] = "Redigera vikt";
    $g_lang["group_rename"] = "Byta namn på noder i gruppen ";
    $g_lang["enter_vertices_text_in_each_line"] = "Ange text för varje nod i en separat rad";
    $g_lang["or"] = "eller";
    $g_lang["vote"] = "Förhör";
    $g_lang["vote_question"] = "Vilka funktioner ska vi lägga till först?";
    $g_lang["what_algorithm_need"] = "Skriv gärna vilken typ av algoritm du vill se på den här webbsidan.";
    $g_lang["recommend_algorithm"] = "Rekommendera algoritmer";
    $g_lang["what_algorithm_we_have"] = "Vår tjänst stöder redan dessa funktioner: <a href=\"/en/wiki/Help/FindTheShortestPath\" target=\"_blank\" style=\"text-decoration: underline\"> Hitta den kortaste vägen med Dijkstras algoritm </a>, <a href = \"/en/wiki/Help/AdjacencyMatrix\" target = \"_ blank\" style = \"text-decoration: underline\"> Grannmatris </a>, <a href = \"/en/wiki/Help/IncidenceMatrix\" target = \"_blank\" style = \"text-decoration: understrykning\"> Incidensmatrix </a>.";
    $g_lang["has_eulerian_path"] = "Grafen har Eulerväg";
    $g_lang["has_not_eulerian_path"] = "Grafen har inte Eulerväg";
    $g_lang["min_dist_matrix_description"] = "Matris med minimala avstånd";
    $g_lang["graphOfMinDist"] = "Graf av minimal avstånd";
    $g_lang["checkToSave"] = "Klicka för att spara";
    $g_lang["showDistMatrix"] = "Visa distansmatris";
    $g_lang["distMatrixText"] = "Distansmatris";
    $g_lang["selectStartVertexForMaxFlow"] = "Välj en källa för det maximala flödet";
    $g_lang["selectFinishVertexForMaxFlow"] = "Välj ett utlopp för det maximala flödet";
    $g_lang["maxFlowResult"] = "Maximalt flöde från %2 till %3 är lika med %1";
    $g_lang["flowNotExists"] = "Flödet från %1 i %2 finns inte";
    $g_lang["sourceVertex"] = "Källa";
    $g_lang["sinkVertex"] = "Stoke";
    $g_lang["export_graph"] = "Exportera till fil";
    $g_lang["import_graph"] = "Importera från fil";
    $g_lang["has_hamiltonian_path"] = "Graf har Hamiltonväg";
    $g_lang["has_not_hamiltonian_path"] = "Graf har inte Hamiltonväg";
    $g_lang["has_hamiltonian_loop"] = "Graf har Hamiltoncykel";
    $g_lang["has_not_hamiltonian_loop"] = "Graf har inte Hamiltoncykel";
    $g_lang["start_traversal"] = "Välj startpunkten för traversalen";
    $g_lang["traversal_order"] = "Traversal order";
    $g_lang["curve_edge"] = "Bågböj";
    $g_lang["undo"] = "Annullera";
    $g_lang["opensource_message"] = "Vårt projekt har blivit ett öppen källkodsprojekt. Mer information";
    $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"] = "Inställningar";
    $g_lang["common_vertex_settings"] = "Vanliga noder";
    $g_lang["selected_vertex_settings"] = "Valda hörn";
    $g_lang["common_edge_settings"] = "Vanliga bågar";
    $g_lang["selected_edge_settings"] = "Valda bågar";
    $g_lang["common_color"] = "Huvudfärg";
    $g_lang["stroke_color"] = "Konturfärg";
    $g_lang["stroke_size"] = "Slagvikt";
    $g_lang["text_color"] = "Text färg";
    $g_lang["save_graph"] = "Spara graf";
    $g_lang["vertex_draw_style"] = "Nodens rendering stil";
    $g_lang["text_background"] = "Textbakgrund";
    $g_lang["edge_draw_style"] = "Kant ritning stil";
    $g_lang["color"] = "Färg";
    $g_lang["alpha"] = "Genomskinlighet";
    $g_lang["background_style"] = "Background";
    $g_lang["adjacency_matrix_multigraph_description"] = "För en multigraf innehåller matrisen värdet på minsta bågar mellan topparna";
    $g_lang["graph_is_multi_message"] = "Multigraph stöder inte alla algoritmer";
    $g_lang["graph_is_general_message"] = "";
    $g_lang["replace_edge"] = "byt ut";
    $g_lang["add_edge"] = "lägg till (multigraf)";
    $g_lang["bfs_name"] = "Utöka första sökningen";
    $g_lang["coloring_name"] = "Att göra graf i färg";
    $g_lang["find_connection_component_name"] = "Att hitta anslutningskomponenter";
    $g_lang["dfs_name"] = "Djupsökning";
    $g_lang["eulerin_loop_name"] = "Hitta Eulercykel";
    $g_lang["eulerin_path_name"] = "Hitta Eulerväg";
    $g_lang["fiold_name"] = "Floyd–Warshall algoritm";
    $g_lang["graph_reorder_name"] = "Organisera grafen";
    $g_lang["hamiltoian_cycle_name"] = "Hitta Hamiltoncykel";
    $g_lang["hamiltonian_path_name"] = "Hitta Hamiltonväg";
    $g_lang["max_flow_name"] = "Minsta flödesökning";
    $g_lang["minimum_spanning_tree"] = "Minimalt spännträdsökning";
    $g_lang["modern_graph_style_name"] = "Мiktbaserad visualisering";
    $g_lang["radius_and_diameter_name"] = "Hitta radien och diametern på en graf";
    $g_lang["find_short_path_name"] = "Hitta den kortaste vägen med Dijkstras algoritm";
    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
    $g_lang["vertices_degree_name"] = "Кäkna graden av vertikaler";

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