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
/****************************************************************************** * * Project: GDAL/OGR Geography Network support (Geographic Network Model) * Purpose: GNM graph implementation. * Authors: Mikhail Gusev (gusevmihs at gmail dot com) * Dmitry Baryshnikov, polimax@mail.ru * ****************************************************************************** * Copyright (c) 2014, Mikhail Gusev * Copyright (c) 2014-2015, NextGIS * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included * in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. ****************************************************************************/ #ifndef GNMGRAPH_H #define GNMGRAPH_H #include "cpl_port.h" #if defined(__cplusplus) && !defined(CPL_SUPRESS_CPLUSPLUS) #include #include #include #include #endif // Alias for some big data type to store identificators. #define GNMGFID GIntBig // Graph constants #define GNM_EDGE_DIR_BOTH 0 // bidirectional #define GNM_EDGE_DIR_SRCTOTGT 1 // from source to target #define GNM_EDGE_DIR_TGTTOSRC 2 // from target to source #if defined(__cplusplus) && !defined(CPL_SUPRESS_CPLUSPLUS) // Types declarations. typedef std::vector GNMVECTOR, *LPGNMVECTOR; typedef const std::vector GNMCONSTVECTOR; typedef const std::vector *LPGNMCONSTVECTOR; typedef std::pair EDGEVERTEXPAIR; typedef std::vector GNMPATH; /** Edge */ struct GNMStdEdge { GNMGFID nSrcVertexFID = 0; /**< Source vertex FID */ GNMGFID nTgtVertexFID = 0; /**< Target vertex FID */ bool bIsBidir = false; /**< Whether the edge is bidirectonal */ double dfDirCost = 0; /**< Direct cost */ double dfInvCost = 0; /**< Inverse cost */ bool bIsBlocked = false; /**< Whether the edge is blocked */ }; /** Vertex */ struct GNMStdVertex { GNMVECTOR anOutEdgeFIDs{}; /**< TODO */ bool bIsBlocked = false; /**< Whether the vertex is blocked */ }; /** * The simple graph class, which holds the appropriate for * calculations graph in memory (based on STL containers) and provides * several basic algorithms of this graph's analysis. See the methods of * this class for details. The common thing for all analysis methods is that * all of them return the results in the array of GFIDs form. Use the * GNMGraph class to receive the results in OGRLayer form. * NOTE: GNMGraph holds the whole graph in memory, so it can consume * a lot of memory if operating huge networks. * * @since GDAL 2.1 */ class CPL_DLL GNMGraph /* non final */ { public: GNMGraph(); virtual ~GNMGraph(); // GNMGraph /** * @brief Add a vertex to the graph * * NOTE: if there are vertices with these ID's already - nothing will be * added. * * @param nFID - vertex identificator */ virtual void AddVertex(GNMGFID nFID); /** * @brief Delete vertex from the graph * @param nFID Vertex identificator */ virtual void DeleteVertex(GNMGFID nFID); /** * @brief Add an edge to the graph * @param nConFID Edge identificator * @param nSrcFID Source vertex identificator * @param nTgtFID Target vertex identificator * @param bIsBidir Is bidirectional * @param dfCost Cost * @param dfInvCost Inverse cost */ virtual void AddEdge(GNMGFID nConFID, GNMGFID nSrcFID, GNMGFID nTgtFID, bool bIsBidir, double dfCost, double dfInvCost); /** * @brief Delete edge from graph * @param nConFID Edge identificator */ virtual void DeleteEdge(GNMGFID nConFID); /** * @brief Change edge properties * @param nFID Edge identificator * @param dfCost Cost * @param dfInvCost Inverse cost */ virtual void ChangeEdge(GNMGFID nFID, double dfCost, double dfInvCost); /** * @brief Change the block state of edge or vertex * @param nFID Identificator * @param bBlock Block or unblock */ virtual void ChangeBlockState(GNMGFID nFID, bool bBlock); /** * @brief Check if vertex is blocked * @param nFID Vertex identificator * @return true if blocked, false if not blocked. */ virtual bool CheckVertexBlocked(GNMGFID nFID) const; /** * @brief Change all vertices and edges block state. * * This is mainly use for unblock all vertices and edges. * * @param bBlock Block or unblock */ virtual void ChangeAllBlockState(bool bBlock = false); /** * @brief An implementation of Dijkstra shortest path algorithm. * * Returns the best path between nStartFID and nEndFID features. Method * uses @see DijkstraShortestPathTree and after that searches in * the resulting tree the path from end to start point. * * @param nStartFID Start identificator * @param nEndFID End identificator * @return an array of best path included identificator of vertices and * edges */ virtual GNMPATH DijkstraShortestPath(GNMGFID nStartFID, GNMGFID nEndFID); /** * @brief An implementation of KShortest paths algorithm. * * Calculates several best paths between two points. Method takes in account * the blocking state of features, i.e. the blocked features are the * barriers during the routing process. * * @param nStartFID Vertex identificator from which to start paths * calculating. * @param nEndFID Vertex identificator to which the path will be calculated. * @param nK How much best paths try to find between start and end points. * @return an array of best paths. Each path is an array of pairs, where the * first in a pair is a vertex identificator and the second is an edge * identificator leading to this vertex. The elements in a path array are * sorted by the path segments order, i.e. the first is the pair (nStartFID, * -1) and the last is (nEndFID, <some edge>). * If there is no any path between start and end vertex the returned array * of paths will be empty. Also the actual amount of paths in the returned * array can be less or equal than the nK parameter. */ virtual std::vector KShortestPaths(GNMGFID nStartFID, GNMGFID nEndFID, size_t nK); /** * @brief Search connected components of the network * * Returns the resource distribution in the network. Method search starting * from the features identificators from input array. Uses the recursive * Breadth-first search algorithm to find the connected to the given vector * of GFIDs components. Method takes in account the blocking state of * features, i.e. the blocked features are the barriers during the routing * process. * * @param anEmittersIDs - array of emitters identificators * @return an array of connected identificators */ virtual GNMPATH ConnectedComponents(const GNMVECTOR &anEmittersIDs); /** Clear */ virtual void Clear(); protected: /** * @brief Method to create best path tree. * * Calculates and builds the best path tree with the Dijkstra * algorithm starting from the nFID. Method takes in account the blocking * state of features, i.e. the blocked features are the barriers during the * routing process. * * @param nFID - Vertex identificator from which to start tree building * @param mstEdges - TODO * @param mnPathTree - means < vertex id, edge id >. * std::map where the first is vertex identificator and the second * is the edge identificator, which is the best way to the current vertex. * The identificator to the start vertex is -1. If the vertex is isolated * the returned map will be empty. */ virtual void DijkstraShortestPathTree(GNMGFID nFID, const std::map &mstEdges, std::map &mnPathTree); /** DijkstraShortestPath */ virtual GNMPATH DijkstraShortestPath(GNMGFID nStartFID, GNMGFID nEndFID, const std::map &mstEdges); //! @cond Doxygen_Suppress virtual LPGNMCONSTVECTOR GetOutEdges(GNMGFID nFID) const; virtual GNMGFID GetOppositVertex(GNMGFID nEdgeFID, GNMGFID nVertexFID) const; virtual void TraceTargets(std::queue &vertexQueue, std::set &markedVertIds, GNMPATH &connectedIds); protected: std::map m_mstVertices{}; std::map m_mstEdges{}; //! @endcond }; #endif // __cplusplus #endif /* GNMGRAPH_H */