ó ,µ[c @s'dZddlmZmZmZmZmZddlmZddl m Z m Z ddl m Z mZmZmZddlZddd d d d d ddddddg Zdd„Zeed„Zd„Zd„Zeed„Zd„Zd„Zd„Zd„ZeZeZZ Z!dS(s»View of Graphs as SubGraph, Reverse, Directed, Undirected. In some algorithms it is convenient to temporarily morph a graph to exclude some nodes or edges. It should be better to do that via a view than to remove and then re-add. In other algorithms it is convenient to temporarily morph a graph to reverse directed edges, or treat a directed graph as undirected, etc. This module provides those graph views. The resulting views are essentially read-only graphs that report data from the orignal graph object. We provide an attribute G._graph which points to the underlying graph object. Note: Since graphviews look like graphs, one can end up with view-of-view-of-view chains. Be careful with chains because they become very slow with about 15 nested views. For the common simple case of node induced subgraphs created from the graph class, we short-cut the chain by returning a subgraph of the original graph directly rather than a subgraph of a subgraph. We are careful not to disrupt any edge filter in the middle subgraph. In general, determining how to short-cut the chain is tricky and much harder with restricted_views than with induced subgraphs. Often it is easiest to use .copy() to avoid chains. iÿÿÿÿ(tUnionAdjacencytUnionMultiAdjacencyt FilterAtlastFilterAdjacencytFilterMultiAdjacency(t no_filter(t NetworkXErrortNetworkXNotImplemented(tGraphtDiGrapht MultiGrapht MultiDiGraphNtgeneric_graph_viewt subgraph_viewt reverse_viewtSubGrapht SubDiGrapht SubMultiGraphtSubMultiDiGrapht ReverseViewtMultiReverseViewt DiGraphViewtMultiDiGraphViewt GraphViewtMultiGraphViewcCsH|dkr|jƒ}ntjd|ƒ}|jƒ|jƒkrTtdƒ‚ntj|ƒ}||_|j|_|j |_ |j ƒrê|j ƒrÃ|j |_ |j |_ |j |_ qD|j |_ |j |_ |j |_ nZ|j ƒr8|jƒrt|j |j ƒ|_ qDt|j |j ƒ|_ n |j |_ |S(Nis-Multigraph for G must agree with create_using(tNonet __class__tnxt empty_grapht is_multigraphRtfreezet_graphtgrapht_nodet is_directedt_succt_predt_adjRR(tGt create_usingtnewG((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR 5s.             csñtj|jƒƒ}||_ˆ|_||_|j|_t|j|ƒ|_|j ƒrut }‡fd†}nt }‡fd†}|j ƒrÕ||j |ˆƒ|_ ||j||ƒ|_|j |_n||j|ˆƒ|_|S(Ncsˆ|||ƒS(N((tutvtk(t filter_edge(s:lib/python2.7/site-packages/networkx/classes/graphviews.pyt reverse_edgecscs ˆ||ƒS(N((R)R*(R,(s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR-gs(RRRt_NODE_OKt_EDGE_OKRR RR!RRRR"R#R$R%(R&t filter_nodeR,R(tAdjR-((R,s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR Vs"      cCsV|jƒs!d}t|ƒ‚nt|ƒ}|j|j|_|_|j|_|S(Ns#not implemented for undirected type(R"RR R$R#R%(R&tmsgR(((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyRqs   cCs5ddl}d}|j|dtddƒt|ƒS(Niÿÿÿÿs3ReverseView is deprecated. Use reverse_view insteadtcategoryt stackleveli(twarningstwarntDeprecationWarningR(R&R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR|s cCs;ddl}d}|j|dtddƒt|||ƒS(Niÿÿÿÿs1SubGraph is deprecated. Use subgraph_view insteadR3R4i(R5R6R7R (R&R0R,R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR„s cCs8ddl}d}|j|dtddƒt|tƒS(Niÿÿÿÿs7GraphView is deprecated. Use generic_graph_view insteadR3R4i(R5R6R7R R(R&R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyRŒs cCs8ddl}d}|j|dtddƒt|tƒS(Niÿÿÿÿs7GraphView is deprecated. Use generic_graph_view insteadR3R4i(R5R6R7R R (R&R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR”s cCs8ddl}d}|j|dtddƒt|tƒS(Niÿÿÿÿs7GraphView is deprecated. Use generic_graph_view insteadR3R4i(R5R6R7R R (R&R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyRœs cCs8ddl}d}|j|dtddƒt|tƒS(Niÿÿÿÿs7GraphView is deprecated. Use generic_graph_view insteadR3R4i(R5R6R7R R (R&R5R2((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyR¤s ("t__doc__tnetworkx.classes.coreviewsRRRRRtnetworkx.classes.filtersRtnetworkx.exceptionRRtnetworkx.classesRR R R tnetworkxRt__all__RR R RRRRRRRRRRR(((s:lib/python2.7/site-packages/networkx/classes/graphviews.pyt#s*("     !