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 2004 The Trustees of Indiana University. // Use, modification and distribution is subject to 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) // Authors: Douglas Gregor // Andrew Lumsdaine #ifndef BOOST_GRAPH_VERTEX_AND_EDGE_RANGE_HPP #define BOOST_GRAPH_VERTEX_AND_EDGE_RANGE_HPP #include #include namespace boost { namespace graph { template < typename Graph, typename VertexIterator, typename EdgeIterator > class vertex_and_edge_range { typedef graph_traits< Graph > traits_type; public: typedef typename traits_type::directed_category directed_category; typedef typename traits_type::edge_parallel_category edge_parallel_category; struct traversal_category : public virtual vertex_list_graph_tag, public virtual edge_list_graph_tag { }; typedef std::size_t vertices_size_type; typedef VertexIterator vertex_iterator; typedef typename std::iterator_traits< VertexIterator >::value_type vertex_descriptor; typedef EdgeIterator edge_iterator; typedef typename std::iterator_traits< EdgeIterator >::value_type edge_descriptor; typedef std::size_t edges_size_type; typedef void adjacency_iterator; typedef void out_edge_iterator; typedef void in_edge_iterator; typedef void degree_size_type; static vertex_descriptor null_vertex() { return traits_type::null_vertex(); } vertex_and_edge_range(const Graph& g, VertexIterator first_v, VertexIterator last_v, vertices_size_type n, EdgeIterator first_e, EdgeIterator last_e, edges_size_type m) : g(&g) , first_vertex(first_v) , last_vertex(last_v) , m_num_vertices(n) , first_edge(first_e) , last_edge(last_e) , m_num_edges(m) { } vertex_and_edge_range(const Graph& g, VertexIterator first_v, VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) : g(&g) , first_vertex(first_v) , last_vertex(last_v) , first_edge(first_e) , last_edge(last_e) { m_num_vertices = std::distance(first_v, last_v); m_num_edges = std::distance(first_e, last_e); } const Graph* g; vertex_iterator first_vertex; vertex_iterator last_vertex; vertices_size_type m_num_vertices; edge_iterator first_edge; edge_iterator last_edge; edges_size_type m_num_edges; }; template < typename Graph, typename VertexIterator, typename EdgeIterator > inline std::pair< VertexIterator, VertexIterator > vertices( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return std::make_pair(g.first_vertex, g.last_vertex); } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::vertices_size_type num_vertices( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return g.m_num_vertices; } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline std::pair< EdgeIterator, EdgeIterator > edges( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return std::make_pair(g.first_edge, g.last_edge); } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edges_size_type num_edges( const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return g.m_num_edges; } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::vertex_descriptor source(typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return source(e, *g.g); } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::vertex_descriptor target(typename vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >::edge_descriptor e, const vertex_and_edge_range< Graph, VertexIterator, EdgeIterator >& g) { return target(e, *g.g); } template < typename Graph, typename VertexIterator, typename EdgeIterator > inline vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > make_vertex_and_edge_range(const Graph& g, VertexIterator first_v, VertexIterator last_v, EdgeIterator first_e, EdgeIterator last_e) { typedef vertex_and_edge_range< Graph, VertexIterator, EdgeIterator > result_type; return result_type(g, first_v, last_v, first_e, last_e); } } // end namespace graph using graph::make_vertex_and_edge_range; using graph::vertex_and_edge_range; } // end namespace boost #endif // BOOST_GRAPH_VERTEX_AND_EDGE_RANGE_HPP