<?php
    $g_lang["title_notg"] = "Kürzesten Weg finden";
    $g_lang["text"] = "<p>Erstelle einen Graphen und finde den kürzesten Weg. Auf der Hilfe-Seite findest du ein <a href=\"/de/help\">Erklärvideo</a>.</p>";
    $g_lang["add_node"] = "Knoten hinzufügen";
    $g_lang["connect_nodes"] = "Knoten verbinden";
    $g_lang["delete"] = "Objekt entfernen";
    $g_lang["default"] = "Standard";
    $g_lang["short_path"] = "Kürzesten Weg finden";
    $g_lang["save_direction_choose"] = "Kantentyp speichern";
    $g_lang["edge_weight"] = "Gewicht";
    $g_lang["save_weight_choose"] = "Wert auf folgende Kanten übertragen";
    $g_lang["default_weight"] = "nicht-gewichtet";
    $g_lang["browser_no_support"] = "Dein Browser wird nicht unterstützt";
    $g_lang["select_and_move_objects"] = "Wähle ein Objekt aus und verschiebe es mit der Maus, oder bewege das Feld";
    $g_lang["move_cursor_for_moving"] = "Ziehe Objekte zum Bewegen";
    $g_lang["add_graph"] = "Kante hinzufügen";
    $g_lang["orint_edge"] = "Gerichtet";
    $g_lang["not_orint_edge"] = "Nicht-gerichtet";
    $g_lang["show_adjacency_matrix"] = "Adjazenzmatrix";
    $g_lang["save"] = "Speichern";
    $g_lang["cancel"] = "Abbrechen";
    $g_lang["adjacency_matrix_description"] = "Abjazenzmatrix eingeben, Komma als Teiler";
    $g_lang["adjacency_matrix_bad_format"] = "Matrix nicht korrekt. Benutze ein Komma als Teiler, die Matrix sollte ein Quadrat ergeben";
    $g_lang["delete_all"] = "Alles entfernen";
    $g_lang["click_to_add_vertex"] = "Klick auf das Feld, um einen Knoten hinzuzufügen. <span style=\"float:right;\">Knotenbenennung <select id=\"enumVertexsText\"></select></span>";
    $g_lang["select_first_vertext_to_connect"] = "Wähle den ersten Knoten der Kante aus";
    $g_lang["select_second_vertext_to_connect"] = "Wähle den zweiten KNoten der Kante aus";
    $g_lang["select_start_short_path_vertex"] = "Wähle einen Startknoten";
    $g_lang["select_finish_short_path_vertex"] = "Wähle einen Zielknoten";
    $g_lang["short_path_result"] = "Der kürzeste Weg ist %d";
    $g_lang["path_not_exists"] = "Kein Weg vorhanden";
    $g_lang["select_object_to_delete"] = "Klick auf ein Objekt, um es zu entfernen";
    $g_lang["shortest_dist"] = "Der geringste Abstand ist";
    $g_lang["show_incidence_matrix"] = "Inzidenzmatrix";
    $g_lang["incidence_matrix_description"] = "Inzidenzmatrix eingeben. Komma als Teiler";
    $g_lang["incidence_matrix_bad_format"] = "Matrix nicht korrekt. Benutze ein Komma als Teiler.";
    $g_lang["this_is_graph_link"] = "Graph gespeichert. Folge diesem Link, um ihn zu anzusehen.";
    $g_lang["share_graph_text"] = "Graph Online: Gespeicherter Graph";
    $g_lang["share_graph_description"] = "Link in sozialen Medien teilen:";
    $g_lang["graph"] = "Graph";
    $g_lang["save_dialog_title"] = "Graph speichern";
    $g_lang["close_button"] = "Schließen";
    $g_lang["connected_component"] = "Verbundene Objekte finden";
    $g_lang["sick_connected_component_result"] = "Die Anzahl der schwach verbundenen Objekten ist";
    $g_lang["connected_component_result"] = "Die Anzahl der verbundenen Objekten ist";
    $g_lang["new_graph"] = "Graph erstellen";
    $g_lang["what_do_you_think"] = "Was hältst du von der Seite?";
    $g_lang["name"] = "Name (E-Mail für Rückmeldung)";
    $g_lang["feedback"] = "Rückmeldung";
    $g_lang["send"] = "Senden";
    $g_lang["write_to_us"] = "Bei Fragen und Kommentaren, schreib uns an";
    $g_lang["fix_matrix_button"] = "Matrix reparieren";
    $g_lang["open_matrix_help"] = "Hilfe";
    $g_lang["wrong_matrix_title"] = "Matrix hat ein falsches Format";
    $g_lang["bad_adj_matrix_message"] = "Adjazenzmatrix im falschen Format. Klick \"Matrix reparieren\" oder \"Hilfe\", um das korrekte Format zu sehen.";
    $g_lang["bad_inc_matrix_message"] = "Inzidenzmatrix im falschen Format. Klick \"Matrix reparieren\" oder \"Hilfe\", um das korrekte Format zu sehen.";
    $g_lang["save_image"] = "Screenshot";
    $g_lang["save_full_image"] = "Bild speichern";
    $g_lang["save_print_image"] = "Gedrucktes Bild des Graphen (schwarz-weiß)";
    $g_lang["open_saved_image_browser"] = "Bild in Browser öffnen";
    $g_lang["download_saved_image"] = "Gespeichertes Bild herunterladen";
    $g_lang["save_image_dialog_title"] = "Bild vom Graphen speichern";
    $g_lang["full_report"] = "Kompletter Bericht";
    $g_lang["short_report"] = "Kurzer Bericht";
    $g_lang["find_eulerian_loop"] = "Eulerkreis finden";
    $g_lang["has_eulerian_loop"] = "Graph hat einen Eulerkreis";
    $g_lang["has_not_eulerian_loop"] = "Graph hat keinen Eulerkreis";
    $g_lang["algorithms"] = "Algorithmen";
    $g_lang["processing"] = "Verarbeiten...";
    $g_lang["view"] = "Anzeige";
    $g_lang["view_keys"] = "Mit W, A, S und D bewegen";
    $g_lang["zoom_fit"] = "Zoom anpassen";
    $g_lang["zoom_in"] = "Größer";
    $g_lang["zoom_out"] = "Kleiner";
    $g_lang["move_workspace"] = "Feld bewegen";
    $g_lang["custom"] = "Inhalt";
    $g_lang["enter_vertex_title"] = "Geben Sie den Titel ein";
    $g_lang["rename_vertex"] = "Vertex umbenennen";
    $g_lang["rename_text"] = "Umbenennen";
    $g_lang["m_title"] = "Graphen online erstellen und Algorithmen wie den kürzesten Weg finden";
    $g_lang["m_keyWords"] = "Graph online, kürzesten Weg finden, Graph Visualisierung, Graph via Adjazenzmatrix, Inzidenzmatrix, suchverbundene Komponente, Euler-Zyklus, minimal Spannbaum";
    $g_lang["m_description"] = "Graph online erstellen und verschiedene Algorithmen nutzen: den kurzesten Weg finden, Adjazenzmatrix finden, minimalen Spannbaum finden, usw.";
    $g_lang["current_language"] = "de";
    $g_lang["developer_tools_title"] = "Algorithmus erstellen";
    $g_lang["developer_tools_text"] = "Euren Algorithmus unten einfügen und auf \"Run\" drücken";
    $g_lang["developer_tools_run"] = "Laufen";
    $g_lang["developer_tools_submit"] = "auf der Website einreichen";
    $g_lang["algorithm_was_sent"] = "Algorythmus wurde gesendet";
    $g_lang["your_algorithm_was_sent"] = "Ihr Algorithmus wurde zum Überprüfen gesendet und, im Erfolgsfall, wird er auf Website hinzugefügt sein.";
    $g_lang["edit_weight"] = "Gewicht bearbeiten";
    $g_lang["group_rename"] = "die Gruppe umbenennen";
    $g_lang["enter_vertices_text_in_each_line"] = "Text für jeden Knote in separater Zeile einfügen";
    $g_lang["or"] = "oder";
    $g_lang["vote"] = "Abstimmen";
    $g_lang["vote_question"] = "Welche Funktionen mussen wir zuerst hinzufügen?";
    $g_lang["what_algorithm_need"] = "Bitte schreiben Sie, welchen Algorithm würden Sie gerne auf diesen Website sehen?";
    $g_lang["recommend_algorithm"] = "Empfohlene Algorithmen";
    $g_lang["what_algorithm_we_have"] = "Unser Service unterstüzt folgende Funktionen: <a href=\"/de/wiki/Hilfe/KürzestenWegFinden\" target=\"_blank\" style=\"text-decoration: underline\">Kürzesten Weg via Dijkstra Algorithm finden</a>, <a href=\"/de/wiki/Hilfe/AdjazenzMatrix\" target=\"_blank\" style=\"text-decoration: underline\">Adjazenzmatrix</a>, <a href=\"/de/wiki/Help/Inzidenzmatrix\" target=\"_blank\" style=\"text-decoration: underline\">Inzidenzmatrix</a>.";
    $g_lang["has_eulerian_path"] = "Der Graph hat Eulerschen Pfad";
    $g_lang["has_not_eulerian_path"] = "Der Graph hat Eulerschen Pfad nicht";
    $g_lang["min_dist_matrix_description"] = "Die Matrix der minimalen Abständen";
    $g_lang["graphOfMinDist"] = "Der Graph der minimalen Abständen";
    $g_lang["checkToSave"] = "zum Speichern überprüfen";
    $g_lang["showDistMatrix"] = "Distanzmatrix zeigen";
    $g_lang["distMatrixText"] = "Distanzmatrix";
    $g_lang["selectStartVertexForMaxFlow"] = "Quelle vom maximalen Durchfluß wählen";
    $g_lang["selectFinishVertexForMaxFlow"] = "Quelle vom minimalen Durchfluß wählen";
    $g_lang["maxFlowResult"] = "Maximaler Durchfluß von %2 bis %3 ist gleich %1";
    $g_lang["flowNotExists"] = "Durchfluß von %1 bis %2 existiert nicht";
    $g_lang["sourceVertex"] = "Quelle";
    $g_lang["sinkVertex"] = "Sinken";
    $g_lang["export_graph"] = "In Datei exportieren";
    $g_lang["import_graph"] = "Aus Datei importieren";
    $g_lang["has_hamiltonian_path"] = "Der Graph hat Hamiltonischen Pfad";
    $g_lang["has_not_hamiltonian_path"] = "Der Graph hat Hamiltonischen Pfad nicht";
    $g_lang["has_hamiltonian_loop"] = "Der Graph hat Hamilton-Zyklus";
    $g_lang["has_not_hamiltonian_loop"] = "Der Graph hat Hamilton-Zyklus nicht";
    $g_lang["start_traversal"] = "\"Traversalvertex anfangen\" wählen";
    $g_lang["traversal_order"] = "Durchquerungsreihenfolge:";
    $g_lang["curve_edge"] = "Kantenbiegung";
    $g_lang["undo"] = "ruckgängig machen";
    $g_lang["opensource_message"] = "Unser Projekt ist jetzt open source. Mehr Details..";
    $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"] = "Einstellungen";
    $g_lang["common_vertex_settings"] = "Gemeinsame Knoten";
    $g_lang["selected_vertex_settings"] = "Gewählte Knoten";
    $g_lang["common_edge_settings"] = "Gemeinsame Kanten";
    $g_lang["selected_edge_settings"] = "Gewählte Kanten";
    $g_lang["common_color"] = "Gemeinsame Farbe";
    $g_lang["stroke_color"] = "Strichfarbe";
    $g_lang["stroke_size"] = "Dicke";
    $g_lang["text_color"] = "Textfarbe";
    $g_lang["save_graph"] = "Graph speichern";
    $g_lang["vertex_draw_style"] = "Knotenstil";
    $g_lang["text_background"] = "Texthintergrund";
    $g_lang["edge_draw_style"] = "Kantenstil";
    $g_lang["color"] = "Farbe";
    $g_lang["alpha"] = "Opazität";
    $g_lang["background_style"] = "Background";
    $g_lang["adjacency_matrix_multigraph_description"] = "Multigraph-Matrix enthält Gewicht der minimalen Kanten.";
    $g_lang["graph_is_multi_message"] = "Multigraph unterstützt alle Algorithmen nicht";
    $g_lang["graph_is_general_message"] = "";
    $g_lang["replace_edge"] = "aktulle ersetzen";
    $g_lang["add_edge"] = "Einfügen (Multigraph)";
    $g_lang["text_above_edge"] = "Text an der Kante";
    $g_lang["select_groupe_mac"] = "Nutzen Sie Cmd⌘ um mehrere Objekten zu wählen.";
    $g_lang["select_groupe_win"] = "Nutzen Sie Strg um mehrere Objekten zu wählen.";
    $g_lang["drag_select_group"] = "Gruppe ziehen";
    $g_lang["copy_select_group"] = "Gruppe kopieren";
    $g_lang["remove_select_group"] = "Gruppe löschen";
    $g_lang["bfs_name"] = "Breadth-first search";
    $g_lang["coloring_name"] = "Graph-Färbung";
    $g_lang["find_connection_component_name"] = "Verbundene Komponenten finden";
    $g_lang["dfs_name"] = "Depth-first search";
    $g_lang["eulerin_loop_name"] = "Euler-Zyklus finden";
    $g_lang["eulerin_path_name"] = "Euler-Pfad finden";
    $g_lang["fiold_name"] = "Floyd-Warshall algorithm";
    $g_lang["graph_reorder_name"] = "Graph zuordnen";
    $g_lang["hamiltoian_cycle_name"] = "Hamilton-Zyklus finden";
    $g_lang["hamiltonian_path_name"] = "Hamilton-Pfad finden";
    $g_lang["max_flow_name"] = "Maximalen Durchfluß finden";
    $g_lang["minimum_spanning_tree"] = "MST-Suche";
    $g_lang["modern_graph_style_name"] = "Gewicht-basierte Visualisierung";
    $g_lang["radius_and_diameter_name"] = "Graphradius und Graphdiameter suchen";
    $g_lang["find_short_path_name"] = "Kürzesten Weg via Dijkstra Algorithm finden";
    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
    $g_lang["vertices_degree_name"] = "Knotengewicht berechnen";
    $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"] = "Schneeflocke";    

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

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