gqddlmZmZedZGddeZGddeZGddeeZGd d eeZGd d eeZ d S))TypeVarGeneric_TceZdZdZdS) StopSearchzStop graph traversalN__name__ __module__ __qualname____doc__E/granary/edev/quantum/lib/python3.11/site-packages/rustworkx/visit.pyrrsDrrceZdZdZdS) PruneSearchz7Prune part of the search tree while traversing a graph.Nrr rrrrsAADrrc6eZdZdZdZdZdZdZdZdZ dS) BFSVisitorzA visitor object that is invoked at the event-points inside the :func:`~rustworkx.bfs_search` algorithm. By default, it performs no action, and should be used as a base class in order to be useful. cdS)zR This is invoked when a vertex is encountered for the first time. Nr selfvs rdiscover_vertexzBFSVisitor.discover_vertex  rcdSz^ This is invoked on vertex `v` after all of its out edges have been examined. Nr rs r finish_vertexzBFSVisitor.finish_vertex&rrcdSzu This is invoked on each edge as it becomes a member of the edges that form the search tree. Nr res r tree_edgezBFSVisitor.tree_edge, rcdS)z{ This is invoked on back or cross edges for directed graphs and cross edges for undirected graphs. Nr rs r non_tree_edgezBFSVisitor.non_tree_edge3r"rcdS)z This is invoked on the subset of non-tree edges whose target vertex is colored gray at the time of examination. The color gray indicates that the vertex is currently in the queue. Nr rs rgray_target_edgezBFSVisitor.gray_target_edge: rcdS)z This is invoked on the subset of non-tree edges whose target vertex is colored black at the time of examination. The color black indicates that the vertex has been removed from the queue. Nr rs rblack_target_edgezBFSVisitor.black_target_edgeBr'rN) r r r r rrr!r$r&r)r rrrrsx   rrc0eZdZdZdZdZdZdZdZdS) DFSVisitorzA visitor object that is invoked at the event-points inside the :func:`~rustworkx.dfs_search` algorithm. By default, it performs no action, and should be used as a base class in order to be useful. cdS)z This is invoked when a vertex is encountered for the first time. Together we report the discover time of vertex `v`. Nr rrts rrzDFSVisitor.discover_vertexQr"rcdS)aq This is invoked on vertex `v` after `finish_vertex` has been called for all the vertices in the DFS-tree rooted at vertex `v`. If vertex `v` is a leaf in the DFS-tree, then the `finish_vertex` function is called on `v` after all the out-edges of `v` have been examined. Together we report the finish time of vertex `v`. Nr r-s rrzDFSVisitor.finish_vertexXs  rcdSrr rs rr!zDFSVisitor.tree_edgebr"rcdS)a: This is invoked on the back edges in the graph. For an undirected graph there is some ambiguity between tree edges and back edges since the edge :math:`(u, v)` and :math:`(v, u)` are the same edge, but both the `tree_edge()` and `back_edge()` functions will be invoked. One way to resolve this ambiguity is to record the tree edges, and then disregard the back-edges that are already marked as tree edges. An easy way to record tree edges is to record predecessors at the `tree_edge` event point. Nr rs r back_edgezDFSVisitor.back_edgeis  rcdS)z This is invoked on forward or cross edges in the graph. In an undirected graph this method is never called. Nr rs rforward_or_cross_edgez DFSVisitor.forward_or_cross_edgevr"rN) r r r r rrr!r2r4r rrr+r+Ksi    rr+c0eZdZdZdZdZdZdZdZdS)DijkstraVisitorzA visitor object that is invoked at the event-points inside the :func:`~rustworkx.dijkstra_search` algorithm. By default, it performs no action, and should be used as a base class in order to be useful. cdS)z This is invoked when a vertex is encountered for the first time and it's popped from the queue. Together with the node, we report the optimal distance of the node. Nr )rrscores rrzDijkstraVisitor.discover_vertexr'rcdSrr rs rrzDijkstraVisitor.finish_vertexrrcdS)zZ This is invoked on every out-edge of each vertex after it is discovered. Nr redges r examine_edgezDijkstraVisitor.examine_edgerrcdS)zx Upon examination, if the distance of the target of the edge is reduced, this event is emitted. Nr r;s r edge_relaxedzDijkstraVisitor.edge_relaxedr"rcdS)zV Upon examination, if the edge is not relaxed, this event is emitted. Nr r;s redge_not_relaxedz DijkstraVisitor.edge_not_relaxedrrN) r r r r rrr=r?rAr rrr6r6~si   rr6N) typingrrr Exceptionrrrr+r6r rrrDs$####### WT]]             )   ........b00000000f%%%%%gbk%%%%%r