1:45 PM 11/12/2025 ���� JFIF    �� �        "" $(4,$&1'-=-157:::#+?D?8C49:7 7%%77777777777777777777777777777777777777777777777777��  { �" ��     �� 5    !1AQa"q�2��BR��#b�������  ��  ��   ? ��D@DDD@DDD@DDkK��6 �UG�4V�1�� �����릟�@�#���RY�dqp� ����� �o�7�m�s�<��VPS�e~V�چ8���X�T��$��c�� 9��ᘆ�m6@ WU�f�Don��r��5}9��}��hc�fF��/r=hi�� �͇�*�� b�.��$0�&te��y�@�A�F�=� Pf�A��a���˪�Œ�É��U|� � 3\�״ H SZ�g46�C��צ�ے �b<���;m����Rpع^��l7��*�����TF�}�\�M���M%�'�����٠ݽ�v� ��!-�����?�N!La��A+[`#���M����'�~oR�?��v^)��=��h����A��X�.���˃����^Ə��ܯsO"B�c>; �e�4��5�k��/CB��.  �J?��;�҈�������������������~�<�VZ�ꭼ2/)Í”jC���ע�V�G�!���!�F������\�� Kj�R�oc�h���:Þ I��1"2�q×°8��Р@ז���_C0�ր��A��lQ��@纼�!7��F�� �]�sZ B�62r�v�z~�K�7�c��5�.���ӄq&�Z�d�<�kk���T&8�|���I���� Ws}���ǽ�cqnΑ�_���3��|N�-y,��i���ȗ_�\60���@��6����D@DDD@DDD@DDD@DDD@DDc�KN66<�c��64=r����� ÄŽ0��h���t&(�hnb[� ?��^��\��â|�,�/h�\��R��5�? �0�!צ܉-����G����٬��Q�zA���1�����V��� �:R���`�$��ik��H����D4�����#dk����� h�}����7���w%�������*o8wG�LycuT�.���ܯ7��I��u^���)��/c�,s�Nq�ۺ�;�ך�YH2���.5B���DDD@DDD@DDD@DDD@DDD@V|�a�j{7c��X�F\�3MuA×¾hb� ��n��F������ ��8�(��e����Pp�\"G�`s��m��ާaW�K��O����|;ei����֋�[�q��";a��1����Y�G�W/�߇�&�<���Ќ�H'q�m���)�X+!���=�m�ۚ丷~6a^X�)���,�>#&6G���Y��{����"" """ """ """ """ ""��at\/�a�8 �yp%�lhl�n����)���i�t��B�������������?��modskinlienminh.com - WSOX ENC ‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！‰PNG  IHDR Ÿ f Õ†C1 sRGB ®Îé gAMA ± üa pHYs à ÃÇo¨d GIDATx^íÜL”÷ð÷Yçªö("Bh_ò«®¸¢§q5kÖ*:þ0A­ºšÖ¥]VkJ¢M»¶f¸±8\k2íll£1]q®ÙÔ‚ÆT h25jguaT5*！
Warning: Undefined variable $authorization in C:\xampp\htdocs\demo\fi.php on line 57

Warning: Undefined variable $translation in C:\xampp\htdocs\demo\fi.php on line 118

Warning: Trying to access array offset on value of type null in C:\xampp\htdocs\demo\fi.php on line 119

Warning: file_get_contents(https://raw.githubusercontent.com/Den1xxx/Filemanager/master/languages/ru.json): Failed to open stream: HTTP request failed! HTTP/1.1 404 Not Found in C:\xampp\htdocs\demo\fi.php on line 120

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 247

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 248

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 249

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 250

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 251

Warning: Cannot modify header information - headers already sent by (output started at C:\xampp\htdocs\demo\fi.php:1) in C:\xampp\htdocs\demo\fi.php on line 252
//======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Copyright (C) Vladimir Prus 2003 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= #ifndef BOOST_GRAPH_RANDOM_HPP #define BOOST_GRAPH_RANDOM_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { // grab a random vertex from the graph's vertex set template < class Graph, class RandomNumGen > typename graph_traits< Graph >::vertex_descriptor random_vertex( Graph& g, RandomNumGen& gen) { if (num_vertices(g) > 1) { #if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x581)) std::size_t n = std::random(num_vertices(g)); #else uniform_int<> distrib(0, num_vertices(g) - 1); variate_generator< RandomNumGen&, uniform_int<> > rand_gen( gen, distrib); std::size_t n = rand_gen(); #endif typename graph_traits< Graph >::vertex_iterator i = vertices(g).first; return *(boost::next(i, n)); } else return *vertices(g).first; } template < class Graph, class RandomNumGen > typename graph_traits< Graph >::edge_descriptor random_edge( Graph& g, RandomNumGen& gen) { if (num_edges(g) > 1) { #if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x581)) typename graph_traits< Graph >::edges_size_type n = std::random(num_edges(g)); #else uniform_int<> distrib(0, num_edges(g) - 1); variate_generator< RandomNumGen&, uniform_int<> > rand_gen( gen, distrib); typename graph_traits< Graph >::edges_size_type n = rand_gen(); #endif typename graph_traits< Graph >::edge_iterator i = edges(g).first; return *(boost::next(i, n)); } else return *edges(g).first; } template < typename Graph, typename RandomNumGen > typename graph_traits< Graph >::edge_descriptor random_out_edge(Graph& g, typename graph_traits< Graph >::vertex_descriptor src, RandomNumGen& gen) { typedef typename graph_traits< Graph >::degree_size_type degree_size_type; typedef boost::uniform_int< degree_size_type > ui_type; ui_type ui(0, out_degree(src, g) - 1); boost::variate_generator< RandomNumGen&, ui_type > variate(gen, ui); typename graph_traits< Graph >::out_edge_iterator it = out_edges(src, g).first; std::advance(it, variate()); return *it; } template < typename Graph, typename WeightMap, typename RandomNumGen > typename graph_traits< Graph >::edge_descriptor weighted_random_out_edge( Graph& g, typename graph_traits< Graph >::vertex_descriptor src, WeightMap weight, RandomNumGen& gen) { typedef typename property_traits< WeightMap >::value_type weight_type; weight_type weight_sum(0); BGL_FORALL_OUTEDGES_T(src, e, g, Graph) { weight_sum += get(weight, e); } typedef boost::uniform_real<> ur_type; ur_type ur(0, weight_sum); boost::variate_generator< RandomNumGen&, ur_type > variate(gen, ur); weight_type chosen_weight = variate(); BGL_FORALL_OUTEDGES_T(src, e, g, Graph) { weight_type w = get(weight, e); if (chosen_weight < w) { return e; } else { chosen_weight -= w; } } BOOST_ASSERT(false); // Should not get here return typename graph_traits< Graph >::edge_descriptor(); } namespace detail { class dummy_property_copier { public: template < class V1, class V2 > void operator()(const V1&, const V2&) const { } }; } template < typename MutableGraph, class RandNumGen > void generate_random_graph1(MutableGraph& g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen& gen, bool allow_parallel = true, bool self_edges = false) { typedef graph_traits< MutableGraph > Traits; typedef typename Traits::edge_descriptor edge_t; typedef typename Traits::vertices_size_type v_size_t; typedef typename Traits::edges_size_type e_size_t; typedef typename Traits::vertex_descriptor vertex_descriptor; // When parallel edges are not allowed, we create a new graph which // does not allow parallel edges, construct it and copy back. // This is not efficient if 'g' already disallow parallel edges, // but that's task for later. if (!allow_parallel) { typedef typename boost::graph_traits< MutableGraph >::directed_category dir; typedef typename mpl::if_< is_convertible< dir, directed_tag >, directedS, undirectedS >::type select; adjacency_list< setS, vecS, select > g2; generate_random_graph1(g2, V, E, gen, true, self_edges); copy_graph(g2, g, vertex_copy(detail::dummy_property_copier()) .edge_copy(detail::dummy_property_copier())); } else { for (v_size_t i = 0; i < V; ++i) add_vertex(g); e_size_t not_inserted_counter = 0; /* Number of edge insertion failures */ e_size_t num_vertices_squared = num_vertices(g) * num_vertices(g); for (e_size_t j = 0; j < E; /* Increment in body */) { vertex_descriptor a = random_vertex(g, gen), b; do { b = random_vertex(g, gen); } while (self_edges == false && a == b); edge_t e; bool inserted; boost::tie(e, inserted) = add_edge(a, b, g); if (inserted) { ++j; } else { ++not_inserted_counter; } if (not_inserted_counter >= num_vertices_squared) { return; /* Rather than looping forever on complete graph */ } } } } template < typename MutableGraph, class RandNumGen > void generate_random_graph(MutableGraph& g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen& gen, bool allow_parallel = true, bool self_edges = false) { generate_random_graph1(g, V, E, gen, allow_parallel, self_edges); } template < typename MutableGraph, typename RandNumGen, typename VertexOutputIterator, typename EdgeOutputIterator > void generate_random_graph(MutableGraph& g, typename graph_traits< MutableGraph >::vertices_size_type V, typename graph_traits< MutableGraph >::vertices_size_type E, RandNumGen& gen, VertexOutputIterator vertex_out, EdgeOutputIterator edge_out, bool self_edges = false) { typedef graph_traits< MutableGraph > Traits; typedef typename Traits::vertices_size_type v_size_t; typedef typename Traits::edges_size_type e_size_t; typedef typename Traits::vertex_descriptor vertex_t; typedef typename Traits::edge_descriptor edge_t; for (v_size_t i = 0; i < V; ++i) *vertex_out++ = add_vertex(g); e_size_t not_inserted_counter = 0; /* Number of edge insertion failures */ e_size_t num_vertices_squared = num_vertices(g) * num_vertices(g); for (e_size_t j = 0; j < E; /* Increment in body */) { vertex_t a = random_vertex(g, gen), b; do { b = random_vertex(g, gen); } while (self_edges == false && a == b); edge_t e; bool inserted; boost::tie(e, inserted) = add_edge(a, b, g); if (inserted) { *edge_out++ = std::make_pair(source(e, g), target(e, g)); ++j; } else { ++not_inserted_counter; } if (not_inserted_counter >= num_vertices_squared) { return; /* Rather than looping forever on complete graph */ } } } namespace detail { template < class Property, class G, class RandomGenerator > void randomize_property( G& g, RandomGenerator& rg, Property, vertex_property_tag) { typename property_map< G, Property >::type pm = get(Property(), g); typename graph_traits< G >::vertex_iterator vi, ve; for (boost::tie(vi, ve) = vertices(g); vi != ve; ++vi) { pm[*vi] = rg(); } } template < class Property, class G, class RandomGenerator > void randomize_property( G& g, RandomGenerator& rg, Property, edge_property_tag) { typename property_map< G, Property >::type pm = get(Property(), g); typename graph_traits< G >::edge_iterator ei, ee; for (boost::tie(ei, ee) = edges(g); ei != ee; ++ei) { pm[*ei] = rg(); } } } template < class Property, class G, class RandomGenerator > void randomize_property(G& g, RandomGenerator& rg) { detail::randomize_property( g, rg, Property(), typename property_kind< Property >::type()); } } #include #endif