a ¬J5deSã@s~ddlZddlZddlZddlmZddlmZddlmZddlmZGdd„de ƒZ Gd d „d e d Z Gd d „d e ƒZ dS)éNé)Úfields©Úmatrix)Ú distances)ÚutilscseZdZ‡fdd„Z‡ZS)ÚFileMetac sliiiidœ}t| ¡ƒD]T\}}t|tjƒr||d|<||d|j<||d|j<|j|d|<| |¡q| |¡tƒ  ||||¡}|D]Ö}i} t |j ƒD]¶} t | |ƒrÀ|  t | |ƒ¡t| j ¡ƒD]ˆ\}} | durÎ|| vrÎ|  |¡}t|tjƒrÎ|ddg|jddgi} |  ¡D]:\} }|D]*}z| || =WntyLYn0q&qqÎq¢t||| ƒq|S)N)Úfields_by_nameÚfields_by_keywordÚnames_by_keywordÚkeywords_by_namer r r r )ÚlistÚitemsÚ isinstanceÚFÚFieldÚkeywordÚpopÚupdateÚsuperÚ__new__ÚreversedÚ__mro__ÚhasattrÚgetattrÚ__dict__ÚKeyErrorÚsetattr)ÚmcsÚ class_nameÚbasesÚattrsÚcurrentÚnameÚvalueÚ new_classÚkeyÚdataÚbaseZ base_valueZworkZk2ÚkeysZk1©Ú __class__©úK/var/www/html/django/DPS/env/lib/python3.9/site-packages/tsplib95/models.pyrsLü       ÿÿýzFileMeta.__new__)Ú__name__Ú __module__Ú __qualname__rÚ __classcell__r,r,r*r-r srcs’eZdZdZ‡fdd„Zedd„ƒZedd„ƒZedd „ƒZd d „Z ‡fd d „Z ddd„Z dd„Z dd„Z dd„Zdd„Zdd„Zdd„Z‡ZS)ÚProblemzCBase class for all problems. :param data: name-value data c s2tƒ ¡| ¡D]\}}t|||ƒqi|_dS©N)rÚ__init__rrÚ _defaults)Úselfr'r#r$r*r,r-r4Os zProblem.__init__cKs²d |j¡}d}d|›d|›d}t |tj¡}| |¡^}}|ddd…} |ddd…} i} t| | ƒD]6\} } | d krh|j| }|j| }| |   ¡¡| |<qh|fi| ¤|¤ŽS) aParse text into a problem instance. Any keyword options are passed to the class constructor. If a keyword argument has the same name as a field then they will collide and cause an error. :param str text: problem text :param options: any keyword arguments to pass to the constructor :return: problem instance :rtype: :class:`Problem` ú|z \s*:\s*|\s*\nú(z|EOF)(?:ú)NérÚEOF) Újoinr ÚreÚcompileÚMÚsplitÚzipr ÚparseÚstrip)ÚclsÚtextÚoptionsÚkeywordsÚsepÚpatternÚregexÚ__ÚresultsZfield_keywordsZ field_valuesr'rr$Úfieldr#r,r,r-rBVs   z Problem.parsecKs>t|ƒ"}|j|fi|¤ŽWdƒS1s00YdS)a£Load a problem instance from a text file. Any keyword options are passed to the class constructor. If a keyword argument has the same name as a field then they will collide and cause an error. :param str filepath: path to a problem file :param options: any keyword arguments to pass to the constructor :return: problem instance :rtype: :class:`Problem` N)ÚopenÚread)rDÚfilepathrFÚfr,r,r-Úload{s z Problem.loadcKs|j| ¡fi|¤ŽS)a Read a problem instance from a file-like object. Any keyword options are passed to the class constructor. If a keyword argument has the same name as a field then they will collide and cause an error. :param str fp: a file-like object :param options: any keyword arguments to pass to the constructor :return: problem instance :rtype: :class:`Problem` )rBrO)rDÚfprFr,r,r-rO‹s z Problem.readcCs| ¡Sr3)Úrender©r6r,r,r-Ú__str__šszProblem.__str__cs¬zt |d¡}||WSty(Yn0zt |d¡}|j|}WntyVYnJ0| ¡}||jvrŒ|j||krŒt|||j|ƒn ||j|<|j|Stƒ |¡S)Nrr+)ÚobjectÚ__getattribute__rr Úget_default_valuer5rr)r6r#r!rDrMÚdefaultr*r,r-rXs        zProblem.__getattribute__FcCsTi}|jj ¡D]>\}}t||ƒ}||jvs8|| ¡kr|rB|jn|}|||<q|S)z²Return the problem data as a dictionary. :param bool by_keyword: use keywords (True) or names (False) or keys :return: problem data :rtype: dict )r+r rrrrYr)r6Ú by_keywordr'r#rMr$r&r,r,r-Úas_dictºs  zProblem.as_dictcCs |jddS)zsReturn the problem data as a dictionary by field name. :return: problem data :rtype: dict F©r[©r\rUr,r,r-Ú as_name_dictÉszProblem.as_name_dictcCs |jddS)zvReturn the problem data as a dictionary by field keyword. :return: problem data :rtype: dict Tr]r^rUr,r,r-Úas_keyword_dictÑszProblem.as_keyword_dictcCs¢| ¡}t|ƒD]@}| |¡}|jj|}||jvs@|| ¡kr| |¡||j<qg}|  ¡D].\}}d|vrrdnd}|  |›|›|›¡q^|  d¡d  |¡S)NÚ z: z: r;) r_r rr+r rrYrTrrÚappendr<)r6Úrenderedr#r$rMZkvpairsrrHr,r,r-rTÙs    zProblem.rendercCs8t|dƒ}| |¡Wdƒn1s*0YdS)NÚw)rNÚwrite)r6ÚfilenamerQr,r,r-Úsaveìs z Problem.savecCs| | ¡¡dSr3)rerT)r6rSr,r,r-reðsz Problem.writecCsdSr3r,rUr,r,r-ÚvalidateószProblem.validate)F)r.r/r0Ú__doc__r4Ú classmethodrBrRrOrVrXr\r_r`rTrgrerhr1r,r,r*r-r2Is"  $    r2)Ú metaclasscs|eZdZdZe d¡Ze d¡Ze d¡Ze  d¡Z e  d¡Z e d¡Z e d¡Z e d ¡Ze d ¡Ze d ¡Zejd d dZe d¡Ze d¡ZejdddZe d¡Ze d¡Ze d¡Ze d¡Zd>‡fdd„ Z e!dd„ƒZ"e"j#dd„ƒZ"dd„Z$dd „Z%d!d"„Z&d#d$„Z'd%d&„Z(d'd(„Z)d)d*„Z*d+d,„Z+d-d.„Z,d/d0„Z-d1d2„Z.d3d4„Z/d5d6„Z0d?d8d9„Z1d@d:d;„Z2d­óz.StandardProblem.trace_tours..)rÚpairwiseÚsumrb)r6ÚtoursZ solutionsZtourÚedgesÚweightr,rUr-Ú trace_toursšs   zStandardProblem.trace_tourscCst| ¡ƒ}| |g¡dS)zðReturn the weight of the canonical tour. The "canonical tour" uses the nodes in order. This method is present primarily for testing and purposes. :return: weight of the canonical tour :rtype: float r)r Ú get_nodesr’)r6Únodesr,r,r-Útrace_canonical_tour±s z$StandardProblem.trace_canonical_tourcCsæ|jrtt|jƒƒS|jr(tt|jƒƒS|jdkrbtƒ}|jD]\}}| ||h¡q>tt|ƒƒS|jdkr¢tƒ}|j ¡D]\}}| |h|£¡q|tt|ƒƒS|j r¶tt|j ƒƒSztt |j ƒƒWSt yàt dƒ‚Yn0dS)a–Return an iterator over the nodes. This method provides a single way to obtain the nodes of a problem regardless of how it is specified. However, if the nodes are not specified, the EDGE_DATA_FORMAT is not set, and DIMENSION has no value, then nodes are undefined. :return: nodes :rtype: iter :raises ValueError: if the nodes are undefined Ú EDGE_LISTÚADJ_LISTzundefined nodesN)r†ÚiterÚsortedr„rÚsetÚ edge_datarrÚdemandsÚrangeÚ dimensionÚ ExceptionÚ ValueError)r6r”ÚaÚbZendsr,r,r-r“½s(      zStandardProblem.get_nodesc#sn|jdkr|jEdHnR|jdkrP|j ¡D] \‰}‡fdd„|DƒEdHq,nt | ¡| ¡¡EdHdS)a‰Return an iterator over the edges. This method provides a single way to obtain the edges of a problem regardless of how it is specified. If the EDGE_DATA_FORMAT is not set and the nodes are undefined, then the edges are also undefined. :return: edges :rtype: iter :raises ValueError: if the nodes and therefore the edges are undefined r–Nr—c3s|]}ˆ|fVqdSr3r,)rˆrŠ©r‰r,r-r‹òrŒz,StandardProblem.get_edges..)rr›rÚ itertoolsÚproductr“)r6Zadjr,r£r-Ú get_edgesãs  zStandardProblem.get_edgesc Cs@| ¡r8z |j|WSttfy4|j|YS0ndSdS)zÇReturn the display data for node at index *i*. If the problem is not depictable, None is returned instead. :param int i: node index :return: display data for node i N)r‡r„rÚ TypeErrorr†)r6r‰r,r,r-Ú get_displayös  zStandardProblem.get_displayFc Cs| ¡rt ¡nt ¡}|j|jd<|j|jd<|j|jd<|j|jd<|j |jd<t |  ¡ƒ}|rxdd„t |ƒDƒ}ndd„|Dƒ}|D]>}||j v}|j|||j |¡|j |¡|j |¡|d qŠ| ¡D]<\}}| ||¡} ||f|jv} |j||||| | d qÒ|S) aReturn a networkx graph instance representing the problem. The metadata of the problem is associated with the graph itself. Additional problem information is associated with the nodes and edges. For example: .. code-block:: python >>> G = problem.get_graph() >>> G.graph {'name': None, 'comment': '14-Staedte in Burma (Zaw Win)', 'type': 'TSP', 'dimension': 14, 'capacity': None} >>> G.nodes[1] {'coord': (16.47, 96.1), 'display': None, 'demand': None, 'is_depot': False} >>> G.edges[1, 2] {'weight': 2, 'is_fixed': False} If the graph is asymmetric then a :class:`networkx.DiGraph` is returned. Optionally, the nodes can be renamed to be sequential and zero-indexed. :param bool normalize: rename nodes to be zero-indexed :return: graph :rtype: :class:`networkx.Graph` r#ÚcommentÚtyperžÚcapacitycSsi|]\}}||“qSr,r,)rˆr‰Únr,r,r-Ú 4rŒz-StandardProblem.get_graph..cSsi|] }||“qSr,r,)rˆr¬r,r,r-r­6rŒ)ZcoordÚdisplayZdemandÚis_depot)r‘Úis_fixed)rƒÚnetworkxZGraphZDiGraphr#Úgraphr©rªržr«r r“Ú enumerateÚdepotsÚadd_noder†Úgetr„rœr¦rxÚ fixed_edgesZadd_edge) r6Ú normalizeÚGr”Únamesr¬r¯r¡r¢r‘r°r,r,r-Ú get_graphs,!         ý zStandardProblem.get_graphcsjˆ ¡rˆ ¡‰‡fdd„Sˆ ¡r:|dur4tdƒ‚|‰nˆ ¡rPtjˆj‰ndd„S‡‡fdd„}|S)Ncs ˆ||fSr3r,©r‰rŠrr,r-ÚMrŒz/StandardProblem._create_wfunc..z&missing needed special weight functioncSsdS)Nrr,r¼r,r,r-r½YrŒcsˆˆj|ˆj|ƒSr3)r†r¼)r6Úwfuncr,r-Úadapter]sz.StandardProblem._create_wfunc..adapter)r{Ú_create_explicit_matrixr€rŸrrÚTYPESrz)r6rrr¿r,)rr6r¾r-rtIs zStandardProblem._create_wfunccCs8t| ¡ƒ}tj|j}ttj|jŽƒ}|||j |dS)N)Ú min_index) Úminr“rrÁr|r r¤ÚchainÚ edge_weightsrž)r6ÚmZMatrixÚweightsr,r,r-rÀbs  z'StandardProblem._create_explicit_matrix)N)F)N)5r.r/r0rirZ StringFieldr#r©rªZ IntegerFieldržr«Znode_coord_typerzr…r|rZIndexedCoordinatesFieldr†Z EdgeDataFieldr›Z MatrixFieldrÅr„Z EdgeListFieldr·Z DepotsFieldr´Z DemandsFieldrœZ ToursFieldrr4ÚpropertyrrÚsetterrxr{r}rr€r‚rƒr‡r’r•r“r¦r¨r»rtrÀr1r,r,r*r-rl÷sP                      & B rl) r¤r=r±Úrrrrrrªrr2rlr,r,r,r-Ús    </