U td@s"dZddlmZGdddZdS)z)Classes representing matchings on graphs.)Vertexc@seZdZdZdddZddZddZd d Zd d Ze d dZ ddZ ddZ ddZ e ddZejddZe ddZejddZdS)Matchinga|A matching of vertices in a graph. A matching of an undirected graph is a set of edges such that each vertex is incident on at most one matched edge. When each vertex is incident on I{exactly} one matched edge, the matching called I{perfect}. This class is used in C{igraph} to represent non-perfect and perfect matchings in undirected graphs. This class is usually not instantiated directly, everything is taken care of by the functions that return matchings. Examples: >>> from igraph import Graph >>> g = Graph.Famous("noperfectmatching") >>> matching = g.maximum_matching() NcCs<||_d|_d|_d|_t|tr,|j|}||_||_dS)aaInitializes the matching. @param graph: the graph the matching belongs to @param matching: a numeric vector where element I{i} corresponds to vertex I{i} of the graph. Element I{i} is -1 or if the corresponding vertex is unmatched, otherwise it contains the index of the vertex to which vertex I{i} is matched. @param types: the types of the vertices if the graph is bipartite. It must either be the name of a vertex attribute (which will be retrieved for all vertices) or a list. Elements in the list will be converted to boolean values C{True} or C{False}, and this will determine which part of the bipartite graph a given vertex belongs to. @raise ValueError: if the matching vector supplied does not describe a valid matching of the graph. Nr) _graph _matching _num_matched_types isinstancestrvstypesmatching)selfgraphr r rH/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/matching.py__init__s  zMatching.__init__cCs|jS)N)rr rrr__len__6szMatching.__len__cCs>|jdk r$d|jj|j|j|jfSd|jj|j|jfSdS)Nz%s(%r,%r,types=%r)z %s(%r,%r))r __class____name__rrrrrr__repr__9s zMatching.__repr__cCs&|jdk rdt|Sdt|SdS)Nz2Bipartite graph matching (%d matched vertex pairs)z(Graph matching (%d matched vertex pairs))rlenrrrr__str__Ds  zMatching.__str__cs,|jjfddt|jD}|jj|S)zReturns an edge sequence that contains the edges in the matching. If there are multiple edges between a pair of matched vertices, only one of them will be returned. cs.g|]&\}}|dkr||kr||ddqS)F)Zdirectedr).0uvget_eidrr Qsz"Matching.edges..)rr enumerateres)r ZeidxsrrredgesJs  zMatching.edgescCs|jS)z0Returns the graph corresponding to the matching.)rrrrrrXszMatching.graphcCs|jj|j|jdS)zReturns whether the matching is maximal. A matching is maximal when it is not possible to extend it any more with extra edges; in other words, unmatched vertices in the graph must be adjacent to matched vertices only. r )rZ_is_maximal_matchingrrrrrr is_maximal]szMatching.is_maximalcCst|tr|j}|j|dkS)z;Returns whether the given vertex is matched to another one.r)rrindexr)r vertexrrr is_matchedfs zMatching.is_matchedcCsHt|tr.|j|j}|dkr"dS|jj|S|j|}|dkrDdS|S)aReturns the vertex a given vertex is matched to. @param vertex: the vertex we are interested in; either an integer index or an instance of L{Vertex}. @return: the index of the vertex matched to the given vertex, either as an integer index (if I{vertex} was integer) or as an instance of L{Vertex}. When the vertex is unmatched, returns C{None}. rN)rrrr%rr )r r&Zmatchedrrrmatch_ofls    zMatching.match_ofcCs|jS)zReturns the matching vector where element I{i} contains the ID of the vertex that vertex I{i} is matched to. The matching vector will contain C{-1} for unmatched vertices. )rrrrrr szMatching.matchingcCsB|jj||jdstdt||_tdd|jDd|_dS)aQSets the matching vector. @param value: the matching vector which must contain the ID of the vertex matching vertex I{i} at the I{i}th position, or C{-1} if the vertex is unmatched. @raise ValueError: if the matching vector supplied does not describe a valid matching of the graph. r#znot a valid matchingcss|]}|dkrdVqdS)rNr)rirrr sz$Matching.matching..N)rZ _is_matchingr ValueErrorlistrsumr)r valuerrrr s  cCs|jS)aReturns the type vector if the graph is bipartite. Element I{i} of the type vector will be C{False} or C{True} depending on which side of the bipartite graph vertex I{i} belongs to. For non-bipartite graphs, this property returns C{None}. )rrrrrr s zMatching.typescCs2dd|D}t||jkr(td||_dS)NcSsg|] }t|qSr)bool)rxrrrrsz"Matching.types..ztype vector too short)rrZvcountr-r)r r0r rrrr s)N)r __module__ __qualname____doc__rrrrr"propertyrr$r'r(r setterr rrrrrs&       rN)r5Zigraph._igraphrrrrrrs