z iqSSKJrJr \"S5r"SS\5r"SS\5r"SS\\5r"S S \\5r"S S \\5r g ))TypeVarGeneric_Tc\rSrSrSrSrg) StopSearchzStop graph traversalN__name__ __module__ __qualname____firstlineno____doc____static_attributes__r I/home/james-whalen/.local/lib/python3.13/site-packages/rustworkx/visit.pyrrsrrc\rSrSrSrSrg) PruneSearchz7Prune part of the search tree while traversing a graph.r Nr r rrrrsArrc<\rSrSrSrSrSrSrSrSr Sr S r g ) 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. cg)zB This is invoked when a vertex is encountered for the first time. Nr selfvs rdiscover_vertexBFSVisitor.discover_vertex  rcgzN This is invoked on vertex `v` after all of its out edges have been examined. Nr rs r finish_vertexBFSVisitor.finish_vertex&rrcgz] This is invoked on each edge as it becomes a member of the edges that form the search tree. Nr res r tree_edgeBFSVisitor.tree_edge, rcg)zc This is invoked on back or cross edges for directed graphs and cross edges for undirected graphs. Nr r&s r non_tree_edgeBFSVisitor.non_tree_edge3r*rcg)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 r&s rgray_target_edgeBFSVisitor.gray_target_edge: rcg)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 r&s rblack_target_edgeBFSVisitor.black_target_edgeBr1rr N) r r r rrrr"r(r,r/r3rr rrrrs%   rrc6\rSrSrSrSrSrSrSrSr Sr g ) DFSVisitorKzA 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. cg)zv This is invoked when a vertex is encountered for the first time. Together we report the discover time of vertex `v`. Nr rrts rrDFSVisitor.discover_vertexQr*rcg)aA 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 r9s rr"DFSVisitor.finish_vertexXs rcgr%r r&s rr(DFSVisitor.tree_edgebr*rcg)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 r&s r back_edgeDFSVisitor.back_edgeis rcg)zm This is invoked on forward or cross edges in the graph. In an undirected graph this method is never called. Nr r&s rforward_or_cross_edge DFSVisitor.forward_or_cross_edgevr*rr N) r r r rrrr"r(rArDrr rrr6r6Ks   rr6c6\rSrSrSrSrSrSrSrSr Sr g ) DijkstraVisitor~zA 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. cg)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 rrDijkstraVisitor.discover_vertexr1rcgr!r rs rr"DijkstraVisitor.finish_vertexrrcg)zJ This is invoked on every out-edge of each vertex after it is discovered. Nr redges r examine_edgeDijkstraVisitor.examine_edgerrcg)z` Upon examination, if the distance of the target of the edge is reduced, this event is emitted. Nr rOs r edge_relaxedDijkstraVisitor.edge_relaxedr*rcg)zF Upon examination, if the edge is not relaxed, this event is emitted. Nr rOs redge_not_relaxed DijkstraVisitor.edge_not_relaxedrrr N) r r r rrrr"rQrTrWrr rrrGrG~s    rrGN) typingrrr Exceptionrrrr6rGr rrr[s]$ T]   ) ..b00f%gbk%r