U td}@sNdZddlmZddlmZddlZddlZddlZdZddZ d d d Z dS) z Implementation of L{igraph.Graph.Formula()}. You should use this module directly only if you have a very strong reason to do so. In almost all cases, you are better off with calling L{igraph.Graph.Formula()}. )StringIO)UniqueIdGeneratorN)construct_graph_from_formulac #s|dkrgdgddgfVdSttjtjtjg}dggddg}}}d}tt|j}|D]}|\}} } } } |rt fdd| Dr|tj krd}|r|r|||fV|g}}ddg}nt fdd| Drd}|rj||kr|tjkr | t | n| t| nL| d kr6|tj kr6qbn2|tjkrDn$|tjkrRnd ||| f} t| qbd | krd | krddg}nd|d <qbd | krd|d<qbd| krb| d dkrd|d <t| dkrb| ddkrbd|d<qb|||fVdS)a[Parses an edge specification from the head of the given formula part and yields the following: - startpoint(s) of the edge by vertex names - endpoint(s) of the edge by names or an empty list if the vertices are isolated - a pair of bools to denote whether we had arrowheads at the start and end vertices FNz<>-+Tc3s|]}|kVqdSN.0chZ edge_charsrG/home/sam/Atlas/atlas_env/lib/python3.8/site-packages/igraph/formula.py .sz!generate_edges..c3s|]}|kVqdSrrrr rr r 7s:zDinvalid token found in edge specification: %s; token_type=%r; tok=%r<>r+)settokenNAMENUMBERSTRINGtokenizegenerate_tokensr__next__allOPanyappendevalstrNEWLINE ENDMARKER SyntaxErrorlen) formulaZ name_tokens start_names end_names arrowheadsZparsing_verticesZ token_genZ token_info token_typetok_msgrr r generate_edgess^                  r.nameTc s,|dkr|d|gidStgd}}td|D]}|}t|D]\}}} fdd|D} fdd|D| ds| d s|s|fd d | DqNd }| d r|fd d | D| drN|fdd | DqNq:i} t| |<|t ||| d} |r(| | S)a Graph.Formula(formula = None, attr = "name", simplify = True) Generates a graph from a graph formula A graph formula is a simple string representation of a graph. It is very handy for creating small graphs quickly. The string consists of vertex names separated by edge operators. An edge operator is a sequence of dashes (C{-}) that may or may not start with an arrowhead (C{<} at the beginning of the sequence or C{>} at the end of the sequence). The edge operators can be arbitrarily long, i.e., you may use as many dashes to draw them as you like. This makes a total of four different edge operators: - C{-----} makes an undirected edge - C{<----} makes a directed edge pointing from the vertex on the right hand side of the operator to the vertex on the left hand side - C{---->} is the opposite of C{<----} - C{<--->} creates a mutual directed edge pair between the two vertices If you only use the undirected edge operator (C{-----}), the graph will be undirected. Otherwise it will be directed. Vertex names used in the formula will be assigned to the C{name} vertex attribute of the graph. Some simple examples: >>> from igraph import Graph >>> print(Graph.Formula()) # empty graph IGRAPH UN-- 0 0 -- + attr: name (v) >>> g = Graph.Formula("A-B") # undirected graph >>> g.vs["name"] ['A', 'B'] >>> print(g) IGRAPH UN-- 2 1 -- + attr: name (v) + edges (vertex names): A--B >>> g.get_edgelist() [(0, 1)] >>> g2 = Graph.Formula("A-----------B") >>> g2.isomorphic(g) True >>> g = Graph.Formula("A ---> B") # directed graph >>> g.vs["name"] ['A', 'B'] >>> print(g) IGRAPH DN-- 2 1 -- + attr: name (v) + edges (vertex names): A->B If you have may disconnected componnets, you can separate them with commas. You can also specify isolated vertices: >>> g = Graph.Formula("A--B, C--D, E--F, G--H, I, J, K") >>> print(", ".join(g.vs["name"])) A, B, C, D, E, F, G, H, I, J, K >>> g.connected_components().membership [0, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6] The colon (C{:}) operator can be used to specify vertex sets. If an edge operator connects two vertex sets, then every vertex from the first vertex set will be connected to every vertex in the second set: >>> g = Graph.Formula("A:B:C:D --- E:F:G") >>> g.isomorphic(Graph.Full_Bipartite(4, 3)) True Note that you have to quote vertex names if they include spaces or special characters: >>> g = Graph.Formula('"this is" +- "a silly" -+ "graph here"') >>> g.vs["name"] ['this is', 'a silly', 'graph here'] @param formula: the formula itself @param attr: name of the vertex attribute where the vertex names will be stored @param simplify: whether the simplify the constructed graph @return: the constructed graph: Nr) vertex_attrsFz[,\n]csg|] }|qSrrr r/ vertex_idsrr sz0construct_graph_from_formula..csg|] }|qSrrr1r2rr r4src3s |]}D]}||fVq qdSrrr Zid1Zid2end_idsrr r sz/construct_graph_from_formula..Tc3s |]}D]}||fVq qdSrrr5r6rr r sc3s |]}D]}||fVq qdSrrr5r6rr r s) rrecompilesplitstripr.extendlistvaluesr%simplify) clsr&attrr?edgesZdirectedpartr'r(r)Z start_idsr0resultr)r7r3r rds,Yr)Nr/T) __doc__iorZigraph.datatypesrr8rr__all__r.rrrrr s  O