wgedZddlmZmZddlmZmZmZddlZ ddl m Z gdZ e de jdZe de jdd Ze jdd Ze jd dd Ze jd ddZe jddZddZGddZe de jdddZy)a@Functions for finding and manipulating cliques. Finding the largest clique in a graph is NP-complete problem, so most of these algorithms have an exponential running time; for more information, see the Wikipedia article on the clique problem [1]_. .. [1] clique problem:: https://en.wikipedia.org/wiki/Clique_problem ) defaultdictdeque)chain combinationsisliceN)not_implemented_for) find_cliquesfind_cliques_recursivemake_max_clique_graphmake_clique_bipartitenode_clique_numbernumber_of_cliquesenumerate_all_cliquesmax_weight_cliquedirectedc #Kii|D]+}t|<||Dchc] }|vs| c}|<-tfd|D}|rtt|j \}}|t |D]H\}}|j t||gt|jt||dzdfJ|r~yycc}ww)aEReturns all cliques in an undirected graph. This function returns an iterator over cliques, each of which is a list of nodes. The iteration is ordered by cardinality of the cliques: first all cliques of size one, then all cliques of size two, etc. Parameters ---------- G : NetworkX graph An undirected graph. Returns ------- iterator An iterator over cliques, each of which is a list of nodes in `G`. The cliques are ordered according to size. Notes ----- To obtain a list of all cliques, use `list(enumerate_all_cliques(G))`. However, be aware that in the worst-case, the length of this list can be exponential in the number of nodes in the graph (for example, when the graph is the complete graph). This function avoids storing all cliques in memory by only keeping current candidate node lists in memory during its search. The implementation is adapted from the algorithm by Zhang, et al. (2005) [1]_ to output all cliques discovered. This algorithm ignores self-loops and parallel edges, since cliques are not conventionally defined with such edges. References ---------- .. [1] Yun Zhang, Abu-Khzam, F.N., Baldwin, N.E., Chesler, E.J., Langston, M.A., Samatova, N.F., "Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology". *Supercomputing*, 2005. Proceedings of the ACM/IEEE SC 2005 Conference, pp. 12, 12--18 Nov. 2005. . c3XK|]!}|gt|jf#yw)keyN)sorted __getitem__).0uindexnbrss _/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/networkx/algorithms/clique.py z(enumerate_all_cliques..Ss)KAA3tAwE,=,=>?Ks'*N) lenrmaplistpopleft enumerateappendrfilter __contains__r) Grvqueuebasecnbrsirrs @@rrrs^ E D 6u:ad5aun15Q6 KK KE $ 0 e e$ DAq LL$$47//q1ud1KL   6sC CCBCCc # Kt|dk(ry|Dcic]}|||Dchc] }||k7s | c}c}} ||ddng}t||D]}|vrtd|d |zs|ddyj}g}|j dt | fd} |z } |r|j } j| | |d< | } || z} | s|ddnn| z} | rg|j ||f|j d| }| t | fd} |z }n$|j |j \}}cc}wcc}}w#t$rYywxYww) aReturns all maximal cliques in an undirected graph. For each node *n*, a *maximal clique for n* is a largest complete subgraph containing *n*. The largest maximal clique is sometimes called the *maximum clique*. This function returns an iterator over cliques, each of which is a list of nodes. It is an iterative implementation, so should not suffer from recursion depth issues. This function accepts a list of `nodes` and only the maximal cliques containing all of these `nodes` are returned. It can considerably speed up the running time if some specific cliques are desired. Parameters ---------- G : NetworkX graph An undirected graph. nodes : list, optional (default=None) If provided, only yield *maximal cliques* containing all nodes in `nodes`. If `nodes` isn't a clique itself, a ValueError is raised. Returns ------- iterator An iterator over maximal cliques, each of which is a list of nodes in `G`. If `nodes` is provided, only the maximal cliques containing all the nodes in `nodes` are returned. The order of cliques is arbitrary. Raises ------ ValueError If `nodes` is not a clique. Examples -------- >>> from pprint import pprint # For nice dict formatting >>> G = nx.karate_club_graph() >>> sum(1 for c in nx.find_cliques(G)) # The number of maximal cliques in G 36 >>> max(nx.find_cliques(G), key=len) # The largest maximal clique in G [0, 1, 2, 3, 13] The size of the largest maximal clique is known as the *clique number* of the graph, which can be found directly with: >>> max(len(c) for c in nx.find_cliques(G)) 5 One can also compute the number of maximal cliques in `G` that contain a given node. The following produces a dictionary keyed by node whose values are the number of maximal cliques in `G` that contain the node: >>> pprint({n: sum(1 for c in nx.find_cliques(G) if n in c) for n in G}) {0: 13, 1: 6, 2: 7, 3: 3, 4: 2, 5: 3, 6: 3, 7: 1, 8: 3, 9: 2, 10: 2, 11: 1, 12: 1, 13: 2, 14: 1, 15: 1, 16: 1, 17: 1, 18: 1, 19: 2, 20: 1, 21: 1, 22: 1, 23: 3, 24: 2, 25: 2, 26: 1, 27: 3, 28: 2, 29: 2, 30: 2, 31: 4, 32: 9, 33: 14} Or, similarly, the maximal cliques in `G` that contain a given node. For example, the 4 maximal cliques that contain node 31: >>> [c for c in nx.find_cliques(G) if 31 in c] [[0, 31], [33, 32, 31], [33, 28, 31], [24, 25, 31]] See Also -------- find_cliques_recursive A recursive version of the same algorithm. Notes ----- To obtain a list of all maximal cliques, use `list(find_cliques(G))`. However, be aware that in the worst-case, the length of this list can be exponential in the number of nodes in the graph. This function avoids storing all cliques in memory by only keeping current candidate node lists in memory during its search. This implementation is based on the algorithm published by Bron and Kerbosch (1973) [1]_, as adapted by Tomita, Tanaka and Takahashi (2006) [2]_ and discussed in Cazals and Karande (2008) [3]_. It essentially unrolls the recursion used in the references to avoid issues of recursion stack depth (for a recursive implementation, see :func:`find_cliques_recursive`). This algorithm ignores self-loops and parallel edges, since cliques are not conventionally defined with such edges. References ---------- .. [1] Bron, C. and Kerbosch, J. "Algorithm 457: finding all cliques of an undirected graph". *Communications of the ACM* 16, 9 (Sep. 1973), 575--577. .. [2] Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "The worst-case time complexity for generating all maximal cliques and computational experiments", *Theoretical Computer Science*, Volume 363, Issue 1, Computing and Combinatorics, 10th Annual International Conference on Computing and Combinatorics (COCOON 2004), 25 October 2006, Pages 28--42 .. [3] F. Cazals, C. Karande, "A note on the problem of reporting maximal cliques", *Theoretical Computer Science*, Volume 407, Issues 1--3, 6 November 2008, Pages 564--568, rNThe given `nodes`  do not form a cliquec&t|zSNrradjcands rzfind_cliques.. sD3q6M 2rc&t|zSr1r2r3s rr6zfind_cliques.. sCs1v 4Fr7) rset ValueErrorcopyr$maxpopremove IndexError)r'nodesrr(Qnodesubgstackext_uqadj_qsubg_qcand_qr4r5s @@rr r esd 1v{34 5a1!A$)Q!q&q) ) 5C%a2A q6D t 1%8MNO O D  d  99;D EHHTN D23A 3q6ME IIK A"AA$J!E\F dD%%89%%*FG $s1v $)IIK!dE)-* 5V    sJF E, E'E'E,BF;B,E2'E,,F2 E>;F=E>>Fc l t|dk(r tgS|Dcic]}|||Dchc] }||k7s | c}c}}||ddngt|}D]}||vrtd|d||z}|s tgS|j } fd  ||Scc}wcc}}w)aW Returns all maximal cliques in a graph. For each node *v*, a *maximal clique for v* is a largest complete subgraph containing *v*. The largest maximal clique is sometimes called the *maximum clique*. This function returns an iterator over cliques, each of which is a list of nodes. It is a recursive implementation, so may suffer from recursion depth issues, but is included for pedagogical reasons. For a non-recursive implementation, see :func:`find_cliques`. This function accepts a list of `nodes` and only the maximal cliques containing all of these `nodes` are returned. It can considerably speed up the running time if some specific cliques are desired. Parameters ---------- G : NetworkX graph nodes : list, optional (default=None) If provided, only yield *maximal cliques* containing all nodes in `nodes`. If `nodes` isn't a clique itself, a ValueError is raised. Returns ------- iterator An iterator over maximal cliques, each of which is a list of nodes in `G`. If `nodes` is provided, only the maximal cliques containing all the nodes in `nodes` are yielded. The order of cliques is arbitrary. Raises ------ ValueError If `nodes` is not a clique. See Also -------- find_cliques An iterative version of the same algorithm. See docstring for examples. Notes ----- To obtain a list of all maximal cliques, use `list(find_cliques_recursive(G))`. However, be aware that in the worst-case, the length of this list can be exponential in the number of nodes in the graph. This function avoids storing all cliques in memory by only keeping current candidate node lists in memory during its search. This implementation is based on the algorithm published by Bron and Kerbosch (1973) [1]_, as adapted by Tomita, Tanaka and Takahashi (2006) [2]_ and discussed in Cazals and Karande (2008) [3]_. For a non-recursive implementation, see :func:`find_cliques`. This algorithm ignores self-loops and parallel edges, since cliques are not conventionally defined with such edges. References ---------- .. [1] Bron, C. and Kerbosch, J. "Algorithm 457: finding all cliques of an undirected graph". *Communications of the ACM* 16, 9 (Sep. 1973), 575--577. .. [2] Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "The worst-case time complexity for generating all maximal cliques and computational experiments", *Theoretical Computer Science*, Volume 363, Issue 1, Computing and Combinatorics, 10th Annual International Conference on Computing and Combinatorics (COCOON 2004), 25 October 2006, Pages 28--42 .. [3] F. Cazals, C. Karande, "A note on the problem of reporting maximal cliques", *Theoretical Computer Science*, Volume 407, Issues 1--3, 6 November 2008, Pages 564--568, rNr.r/c3 Kt|fd}|z D]`}j|j||}||z}|sddn|z}|r ||Ed{jby7w)Nc&t|zSr1r2r3s rr6z8find_cliques_recursive..expand..sCs1v $6r7r)r=r?r$r>) rDr5rrGrHrIrJrBr4expands ` rrNz&find_cliques_recursive..expands 6 7A A KKN HHQKFEE\Fd %ff555 EEG 6sA&B*B+B)riterr:r;r<) r'rArr( cand_initrC subg_initrBr4rNs @@@rr r *sd 1v{Bx34 5a1!A$)Q!q&q) ) 5C%a2AAI y 1%8MNO OSY  QCy I  )Y ''=* 5s B0 B+B+B0+B0T) returns_graphc||j}ntjd|}tt dt |D}|j d|Dt|d}|jd|D|S)aReturns the maximal clique graph of the given graph. The nodes of the maximal clique graph of `G` are the cliques of `G` and an edge joins two cliques if the cliques are not disjoint. Parameters ---------- G : NetworkX graph create_using : NetworkX graph constructor, optional (default=nx.Graph) Graph type to create. If graph instance, then cleared before populated. Returns ------- NetworkX graph A graph whose nodes are the cliques of `G` and whose edges join two cliques if they are not disjoint. Notes ----- This function behaves like the following code:: import networkx as nx G = nx.make_clique_bipartite(G) cliques = [v for v in G.nodes() if G.nodes[v]["bipartite"] == 0] G = nx.bipartite.projected_graph(G, cliques) G = nx.relabel_nodes(G, {-v: v - 1 for v in G}) It should be faster, though, since it skips all the intermediate steps. rc32K|]}t|ywr1)r:rcs rrz(make_max_clique_graph..s=SV=c3&K|] \}}| ywr1)rr,rVs rrz(make_max_clique_graph..s+41aQ+sc3BK|]\\}}\}}||zs||fywr1rY)rr,c1jc2s rrz(make_max_clique_graph..s'L 0B!RBGaVLs ) __class__nx empty_graphr!r#r add_nodes_fromradd_edges_from)r' create_usingBcliques clique_pairss rr r sxF KKM NN1l +9=\!_==>G+7+++LLLLL Hr7ctjd|}|j|j|dt t |D]8\}}| dz |j d|jfd|D:|S)aReturns the bipartite clique graph corresponding to `G`. In the returned bipartite graph, the "bottom" nodes are the nodes of `G` and the "top" nodes represent the maximal cliques of `G`. There is an edge from node *v* to clique *C* in the returned graph if and only if *v* is an element of *C*. Parameters ---------- G : NetworkX graph An undirected graph. fpos : bool If True or not None, the returned graph will have an additional attribute, `pos`, a dictionary mapping node to position in the Euclidean plane. create_using : NetworkX graph constructor, optional (default=nx.Graph) Graph type to create. If graph instance, then cleared before populated. Returns ------- NetworkX graph A bipartite graph whose "bottom" set is the nodes of the graph `G`, whose "top" set is the cliques of `G`, and whose edges join nodes of `G` to the cliques that contain them. The nodes of the graph `G` have the node attribute 'bipartite' set to 1 and the nodes representing cliques have the node attribute 'bipartite' set to 0, as is the convention for bipartite graphs in NetworkX. rr) bipartitec3&K|]}|f ywr1rY)rr(names rrz(make_clique_bipartite..s/q!T/s)r`raclearrbr#r add_noderc)r'fposrdrkrer,cls ` rr r sF q,'AGGIQ!$<?+02rAv 41 % /B// 0 Hr7c |q|vr/tdttj|DSDcic]2}|tdttj||D4c}St t|}|vrtfd|DSt t }|D]"}t|}|D]}|||ks |||<$|SDcic]}||| c}Scc}wcc}w)a,Returns the size of the largest maximal clique containing each given node. Returns a single or list depending on input nodes. An optional list of cliques can be input if already computed. Parameters ---------- G : NetworkX graph An undirected graph. cliques : list, optional (default=None) A list of cliques, each of which is itself a list of nodes. If not specified, the list of all cliques will be computed using :func:`find_cliques`. Returns ------- int or dict If `nodes` is a single node, returns the size of the largest maximal clique in `G` containing that node. Otherwise return a dict keyed by node to the size of the largest maximal clique containing that node. See Also -------- find_cliques find_cliques yields the maximal cliques of G. It accepts a `nodes` argument which restricts consideration to maximal cliques containing all the given `nodes`. The search for the cliques is optimized for `nodes`. c32K|]}t|ywr1r2rUs rrz%node_clique_number..'sPa3q6PrWc32K|]}t|ywr1r2rUs rrz%node_clique_number..*sH!s1vHrWc3>K|]}|vst|ywr1r2)rrVrAs rrz%node_clique_number..2s9aeqj3q69s )r=r r` ego_graphr!rintr)r'rArfseparate_nodesn size_for_nrV size_of_cs ` rr r sB  zP< Q8N+OPPPSXMN3H|BLLA4F'GHHH  |A' z97999S!J *F  *A!}y( ) 1  **  }&+ ,Az!}  ,,+* -s 7C1! C6c4|tt|}|t|j}t|ts"|}t |Dcgc] }||vsd c}}|Si}|D]#}t |Dcgc] }||vsd c}||<%|Scc}wcc}w)zReturns the number of maximal cliques for each node. Returns a single or list depending on input nodes. Optional list of cliques can be input if already computed. r)r!r rA isinstancer)r'rArfr(rVnumcliqs rrrAs |A' }QWWY eT " '4QQ!Vq45 N =A;AAFa;B c4eZdZdZdZdZdZdZdZdZ y) MaxWeightCliquea;A class for the maximum weight clique algorithm. This class is a helper for the `max_weight_clique` function. The class should not normally be used directly. Parameters ---------- G : NetworkX graph The undirected graph for which a maximum weight clique is sought weight : string or None, optional (default='weight') The node attribute that holds the integer value used as a weight. If None, then each node has weight 1. Attributes ---------- G : NetworkX graph The undirected graph for which a maximum weight clique is sought node_weights: dict The weight of each node incumbent_nodes : list The nodes of the incumbent clique (the best clique found so far) incumbent_weight: int The weight of the incumbent clique c||_g|_d|_|%|jDcic]}|dc}|_y|jD]X}||j|vrd|d}t |t |j||trFd|d|d}t||jDcic]}||j||c}|_ycc}wcc}w)NrrzNode z* does not have the requested weight field.zThe z field of node z is not an integer.) r'incumbent_nodesincumbent_weightrA node_weightsKeyErrorr{rur;)selfr'weightr(errmsgs r__init__zMaxWeightClique.__init__rs! ! >/0wwy 9!A 9D WWY -+$QE)STF"6**!!''!*V"4c:#F:_QEATUF$V,,  -AB J1AGGAJv$6!6 JD !:!Ks C:C"cF||jkDr|dd|_||_yy)ziUpdate the incumbent if the node set C has greater weight. C is assumed to be a clique. N)rr)rCC_weights rupdate_incumbent_if_improvedz,MaxWeightClique.update_incumbent_if_improveds+ d++ +#$Q4D $,D ! ,r7cg}|dd}|rK|d}|j||Dcgc]'}||k7s |jj||r&|)}}|rK|Scc}w)zHGreedily find an independent set of nodes from a set of nodes P.Nr)r$r'has_edge)rPindependent_setr(ws rgreedily_find_independent_setz-MaxWeightClique.greedily_find_independent_setsi aD!A  " "1 %Fqa10EFAFGs AA Ac,|Dcic]}||j|c}d}|dd}|ra|j|}tfd|D}||z }||kDr |S|D]}|xx|zcc<|Dcgc] }|dk7s |}}|ra|Scc}wcc}w)z!Find a set of nodes to branch on.rNc3(K|] }| ywr1rY)rr( residual_wts rrz7MaxWeightClique.find_branching_nodes..s!JQ+a.!Js)rrmin)rrtargetr(total_wtrmin_wt_in_classrs @rfind_branching_nodesz$MaxWeightClique.find_branching_nodess89:1q$++A..:  aD"@@CO!!J/!JJO  'H& % 2A/1 25qQ1!45A5;6sB 3 BBcl|j|||j||j|z }|r||j}|j |||gz}||j |z}|Dcgc]!}|j j||s |#} }|j||| |r{yycc}w)zLook for the best clique that contains all the nodes in C and zero or more of the nodes in P, backtracking if it can be shown that no such clique has greater weight than the incumbent. N) rrrr>r?rr'rrN) rrrrbranching_nodesr(new_C new_C_weightrnew_Ps rrNzMaxWeightClique.expands ))!X633At7L7Lx7WX##%A HHQKGE#d&7&7&::L !;1TVV__Q%:Q;E; KK|U 3  .sTVV]]15Er7T)rreverserN)rr'rArrN)rrAr(s` rfind_max_weight_cliquez&MaxWeightClique.find_max_weight_cliquesXtvv||~+EtT!>qT%6%6q%9A%=>> B5!?s A!A!N) __name__ __module__ __qualname____doc__rrrrrNrrYr7rr~r~Xs&2K"-  4"r7r~r) node_attrscjt||}|j|j|jfS)uFind a maximum weight clique in G. A *clique* in a graph is a set of nodes such that every two distinct nodes are adjacent. The *weight* of a clique is the sum of the weights of its nodes. A *maximum weight clique* of graph G is a clique C in G such that no clique in G has weight greater than the weight of C. Parameters ---------- G : NetworkX graph Undirected graph weight : string or None, optional (default='weight') The node attribute that holds the integer value used as a weight. If None, then each node has weight 1. Returns ------- clique : list the nodes of a maximum weight clique weight : int the weight of a maximum weight clique Notes ----- The implementation is recursive, and therefore it may run into recursion depth issues if G contains a clique whose number of nodes is close to the recursion depth limit. At each search node, the algorithm greedily constructs a weighted independent set cover of part of the graph in order to find a small set of nodes on which to branch. The algorithm is very similar to the algorithm of Tavares et al. [1]_, other than the fact that the NetworkX version does not use bitsets. This style of algorithm for maximum weight clique (and maximum weight independent set, which is the same problem but on the complement graph) has a decades-long history. See Algorithm B of Warren and Hicks [2]_ and the references in that paper. References ---------- .. [1] Tavares, W.A., Neto, M.B.C., Rodrigues, C.D., Michelon, P.: Um algoritmo de branch and bound para o problema da clique máxima ponderada. Proceedings of XLVII SBPO 1 (2015). .. [2] Warren, Jeffrey S, Hicks, Illya V.: Combinatorial Branch-and-Bound for the Maximum Weight Independent Set Problem. Technical Report, Texas A&M University (2016). )r~rrr)r'rmwcs rrrs4f !V $C    4 4 44r7r1)NNN)NNF)NN)r)r collectionsrr itertoolsrrrnetworkxr`networkx.utilsr__all__ _dispatchablerr r r r r rr~rrYr7rrs2+11. Z C!CLZ  ! Fr(r(j%, &, ^%- &- `<-<-~.c"c"LZ X&35'!35r7