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 (c) 2007,2009,2010,2011 Tel-Aviv University (Israel). // All rights reserved. // // This file is part of CGAL (www.cgal.org). // // $URL: https://github.com/CGAL/cgal/blob/v6.1/Arrangement_on_surface_2/include/CGAL/graph_traits_Arrangement_2.h $ // $Id: include/CGAL/graph_traits_Arrangement_2.h b26b07a1242 $ // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial // // // Author(s) : Ron Wein // Efi Fogel #ifndef CGAL_BOOST_GRAPH_TRAITS_ARRANGEMENT_2_H #define CGAL_BOOST_GRAPH_TRAITS_ARRANGEMENT_2_H #include #include /*! \file * Definition of the specialized boost::graph_traits class. */ // include this to avoid a VC15 warning #include #include #include #include #include #include #include namespace boost { /*! \class * Specialization of the BGL graph-traits template, which serves as a (primal) * adapter for Arrangement_on_surface_2, where the valid arrangement vertices * correspond to graph verices and arrangement halfedges correspond to * arrangement edges. * Note that non-fictitious vertices at infinity are also considered as graph * vertices, as they have incident non-fictitious edges. * As halfedges are directed, we consider the graph as directed. We also allow * parallel edges, as two or more different arrangement edges (halfedge pairs) * may connect two adjacent vertices. */ template class graph_traits > { public: typedef GeomTraits Geometry_traits_2; typedef TopTraits Topology_traits; typedef CGAL::Arrangement_on_surface_2 Arrangement_on_surface_2; private: typedef CGAL::Arr_accessor Arr_accessor; typedef typename Arrangement_on_surface_2::Vertex_handle Vertex_handle; typedef typename Arr_accessor::Valid_vertex_iterator Vertex_iterator; typedef typename Arrangement_on_surface_2::Halfedge_handle Halfedge_handle; typedef typename Arrangement_on_surface_2::Halfedge_iterator Halfedge_iterator; typedef typename Arrangement_on_surface_2::Halfedge_around_vertex_circulator Halfedge_around_vertex_circulator; /*! \struct * Define the arrangement traversal category, which indicates the arrangement * models the BidirectionalGraph concept as well as the VertexListGraph and * EdgeListGraph concepts. */ struct Arr_traversal_category : public virtual boost::bidirectional_graph_tag, // This tag refines the // incidence_graph_tag. public virtual boost::vertex_list_graph_tag, // Can iterate over vertices. public virtual boost::edge_list_graph_tag, // Can iterate over edges. public virtual boost::adjacency_graph_tag {}; /*! \class * Iteratator over all outgoing halfedges around a given vertex., skipping * fictitious halfedges. * This is by adapting the Halfedge_around_vertex_circulator type to an * iterator. Moreover, as the circulator goes over all ingoing halfedges * of the vertex, the iterator adapter may return their twin halfedges, if * we need the outgoing halfedges. */ class Halfedge_around_vertex_iterator { public: // Type definitions: typedef Halfedge_around_vertex_iterator Self; typedef std::forward_iterator_tag iterator_category; typedef Halfedge_handle value_type; typedef value_type reference; typedef value_type* pointer; typedef int difference_type; protected: Halfedge_around_vertex_circulator _circ; // The circulator. bool _out; // Do we need the out edges. int _counter; // Counter for the edges. int _cend; // The end counter. Halfedge_handle _hh; // The current halfedge. public: /*! constructs default. */ Halfedge_around_vertex_iterator () : _counter(-1), _cend(-1) {} /*! constructs. * \param circ A circulator for the halfedges around a vertex. * \param out_edges Do we need the outgoing or the ingoing halfedges. * \param counter A counter associated with the iterator. * \param cend The past-the-end counter value. */ Halfedge_around_vertex_iterator (Halfedge_around_vertex_circulator circ, bool out_edges, int counter, int cend) : _circ (circ), _out (out_edges), _counter (counter), _cend (cend) { if (_circ->is_fictitious() && _counter < _cend) ++(*this); if (out_edges) _hh = _circ->twin(); else _hh = _circ; } /*! Equality operators. */ bool operator== (const Self& it) const { return (_circ == it._circ && _out == it._out && _counter == it._counter); } bool operator!= (const Self& it) const { return (_circ != it._circ || _out != it._out || _counter != it._counter); } /*! Dereference operators. */ reference operator* () const { return _hh; } pointer operator-> () const { return &_hh; } /* Increment operators. */ Self& operator++() { do { ++_circ; ++_counter; if (_out) _hh = _circ->twin(); else _hh = _circ; } while (_circ->is_fictitious() && _counter < _cend); return (*this); } Self operator++ (int ) { Self tmp = *this; do { ++_circ; ++_counter; if (_out) _hh = _circ->twin(); else _hh = _circ; } while (_circ->is_fictitious() && _counter < _cend); return tmp; } }; // Data members: Arrangement_on_surface_2 *p_arr; Arr_accessor arr_access; public: // Types required of the Graph concept: typedef typename Arrangement_on_surface_2::Vertex_handle vertex_descriptor; typedef boost::directed_tag directed_category; typedef boost::allow_parallel_edge_tag edge_parallel_category; typedef Arr_traversal_category traversal_category; // Types required by the IncidenceGraph concept: typedef typename Arrangement_on_surface_2::Halfedge_handle edge_descriptor; typedef Halfedge_around_vertex_iterator out_edge_iterator; typedef typename Arrangement_on_surface_2::Size degree_size_type; // Types required by the BidirectionalGraph concept: typedef Halfedge_around_vertex_iterator in_edge_iterator; // Types required by the VertexListGraph concept: typedef boost::counting_iterator vertex_iterator; typedef typename Arrangement_on_surface_2::Size vertices_size_type; // Types required by the EdgeListGraph concept: typedef boost::counting_iterator edge_iterator; typedef typename Arrangement_on_surface_2::Size edges_size_type; // Types not required by any of these concepts: typedef CGAL::Vertex_around_target_iterator adjacency_iterator; /*! constructs. */ graph_traits (const Arrangement_on_surface_2& arr) : p_arr (const_cast (&arr)), arr_access (const_cast (arr)) {} /*! nulls */ static vertex_descriptor null_vertex() { return vertex_descriptor(); } /*! traverses the vertices. */ vertices_size_type number_of_vertices() { return arr_access.number_of_valid_vertices(); } vertex_iterator vertices_begin() { return arr_access.valid_vertices_begin(); } vertex_iterator vertices_end() { return arr_access.valid_vertices_end(); } /*! traverses the edges. */ edge_iterator edges_begin() { return p_arr->halfedges_begin(); } edge_iterator edges_end() { return p_arr->halfedges_end(); } /*! obtains the vertex degree (in degree or out degree). */ degree_size_type degree (vertex_descriptor v) { if (v->is_isolated()) return 0; Halfedge_around_vertex_circulator first = v->incident_halfedges(); Halfedge_around_vertex_circulator circ = first; degree_size_type deg = 0; do { if (! circ->is_fictitious()) deg++; ++circ; } while (circ != first); return deg; } /*! traverses the outgoing halfedges of a given vertex. */ out_edge_iterator out_edges_begin (vertex_descriptor v) { if (v->is_isolated()) return out_edge_iterator(); return out_edge_iterator (v->incident_halfedges(), true, 0, static_cast(v->degree())); } out_edge_iterator out_edges_end (vertex_descriptor v) { if (v->is_isolated()) return out_edge_iterator (); const int deg = static_cast(v->degree()); return out_edge_iterator (v->incident_halfedges(), true, deg, deg); } /*! traverses the ingoing halfedges of a given vertex. */ in_edge_iterator in_edges_begin (vertex_descriptor v) { if (v->is_isolated()) return in_edge_iterator(); const int deg = static_cast(v->degree()); return in_edge_iterator (v->incident_halfedges(), false, 0, deg); } in_edge_iterator in_edges_end (vertex_descriptor v) { if (v->is_isolated()) return in_edge_iterator (); const int deg = static_cast(v->degree()); return in_edge_iterator (v->incident_halfedges(), false, deg, deg); } }; /*! \class * Specialization of the BGL graph-traits template, which serves as a (primal) * adapter for Arrangement_2, where the arrangement vertices correspond to graph * verices and arrangement halfedges correspond to arrangement edges. */ template class graph_traits > : public graph_traits::Geometry_traits_2, typename CGAL::Arrangement_2::Topology_traits> > { typedef Traits_ Traits_2; typedef Dcel_ Dcel; typedef graph_traits::Geometry_traits_2, typename CGAL::Arrangement_2::Topology_traits> > Base; public: /*! constructs. */ graph_traits (const CGAL::Arrangement_2& arr) : Base (arr) {} }; } // namespace boost namespace CGAL { // Functions required by the IncidenceGraph concept: // ------------------------------------------------- /*! obtains the out-degree of a vertex in a given arrangement. * \param v The vertex. * \param arr The arrangement. * \param Number of outgoing halfedges from v. */ template typename boost::graph_traits >:: degree_size_type out_degree (typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return gt_arr.degree (v); } /*! returns a range of the out-edges of a vertex given by its descriptor and the * arrangement it belongs to. * \param v The vertex. * \param arr The arrangement. * \return A pair of out-edges iterators. */ template std::pair >:: out_edge_iterator, typename boost::graph_traits >:: out_edge_iterator> out_edges (typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return std::make_pair (gt_arr.out_edges_begin (v), gt_arr.out_edges_end (v)); } template Iterator_range< typename boost::graph_traits >:: adjacency_iterator> adjacent_vertices(typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { return CGAL::vertices_around_target(v,arr); } /*! obtains the source vertex of an arrangement edge. * \param e The edge. * \param arr The arrangement. * \return The source vertex of e. */ template typename boost::graph_traits >:: vertex_descriptor source (typename boost::graph_traits >:: edge_descriptor e, const CGAL::Arrangement_on_surface_2& /* arr */) { return e->source(); } /*! obtains the target vertex of an arrangement edge. * \param e The edge. * \param arr The arrangement. * \return The source vertex of e. */ template typename boost::graph_traits >:: vertex_descriptor target (typename boost::graph_traits >:: edge_descriptor e, const CGAL::Arrangement_on_surface_2& /* arr */) { return e->target(); } // Functions required by the BidirectionalGraph concept: // ----------------------------------------------------- /*! obtains the in-degree of a vertex in a given arrangement. * \param v The vertex. * \param arr The arrangement. * \param Number of ingoing halfedges to v. */ template typename boost::graph_traits >:: degree_size_type in_degree (typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return gt_arr.degree (v); } /*! returns a range of the in-edges of a vertex given by its descriptor and the * arrangement it belongs to. * \param v The vertex. * \param arr The arrangement. * \return A pair of in-edges iterators. */ template std::pair >:: in_edge_iterator, typename boost::graph_traits >:: in_edge_iterator> in_edges (typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return std::make_pair (gt_arr.in_edges_begin (v), gt_arr.in_edges_end (v)); } /*! obtains the degree of a vertex in a given arrangement. * \param v The vertex. * \param arr The arrangement. * \param Number of ingoing and outgoing halfedges incident to v. */ template typename boost::graph_traits >:: degree_size_type degree (typename boost::graph_traits >:: vertex_descriptor v, const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return (2 * gt_arr.degree (v)); } // Functions required by the VertexListGraph concept: // -------------------------------------------------- /*! obtains the number of vertices in the given arrangement. * \param arr The arrangement. * \return Number of vertices. */ template typename boost::graph_traits >:: vertices_size_type num_vertices (const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return gt_arr.number_of_vertices(); } /*! obtains the range of vertices of the given arrangement. * \param arr The arrangement. * \return A pair of vertex iterators. */ template std::pair >:: vertex_iterator, typename boost::graph_traits >:: vertex_iterator> vertices (const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return std::make_pair (gt_arr.vertices_begin(), gt_arr.vertices_end()); } // Functions required by the EdgeListGraph concept: // ------------------------------------------------ /*! obtains the number of halfedges in the given arrangement. * \param arr The arrangement. * \return Number of halfedges (graph edges). */ template typename boost::graph_traits >:: edges_size_type num_edges (const CGAL::Arrangement_on_surface_2& arr) { return arr.number_of_halfedges(); } /*! obtains the range of halfedges of the given arrangement. * \param arr The arrangement. * \return A pair of halfedge iterators. */ template std::pair >:: edge_iterator, typename boost::graph_traits >:: edge_iterator> edges (const CGAL::Arrangement_on_surface_2& arr) { boost::graph_traits > gt_arr (arr); return std::make_pair (gt_arr.edges_begin(), gt_arr.edges_end()); } } // namespace CGAL #include #endif