var searchIndex = {};
searchIndex["daggy"] = {"doc":"**daggy** is a directed acyclic graph data structure library.","items":[[0,"algo","daggy::petgraph","Graph algorithms.",null,null],[5,"is_cyclic_undirected","daggy::petgraph::algo","Return `true` if the input graph contains a cycle.",null,{"inputs":[{"name":"graph"}],"output":{"name":"bool"}}],[5,"is_cyclic","","**Deprecated: Renamed to `is_cyclic_undirected`.**",null,{"inputs":[{"name":"graph"}],"output":{"name":"bool"}}],[5,"is_cyclic_directed","","Return `true` if the input directed graph contains a cycle.",null,{"inputs":[{"name":"graph"}],"output":{"name":"bool"}}],[5,"toposort","","Perform a topological sort of a directed graph.",null,{"inputs":[{"name":"graph"}],"output":{"name":"vec"}}],[5,"scc","","Compute the *strongly connected components* using Kosaraju's algorithm.",null,{"inputs":[{"name":"graph"}],"output":{"name":"vec"}}],[5,"connected_components","","Return the number of connected components of the graph.",null,{"inputs":[{"name":"graph"}],"output":{"name":"usize"}}],[5,"min_spanning_tree","","Compute a *minimum spanning tree* of a graph.",null,{"inputs":[{"name":"graph"}],"output":{"name":"graph"}}],[5,"dijkstra","","Dijkstra's shortest path algorithm.",null,null],[5,"is_isomorphic","","Return `true` if the graphs `g0` and `g1` are isomorphic.",null,{"inputs":[{"name":"graph"},{"name":"graph"}],"output":{"name":"bool"}}],[0,"graphmap","daggy::petgraph","`GraphMap<N, E>` is an undirected graph where node values are mapping keys.",null,null],[3,"GraphMap","daggy::petgraph::graphmap","`GraphMap<N, E>` is an undirected graph, with generic node values `N` and edge weights `E`.",null,null],[8,"NodeTrait","","A trait group for `GraphMap`'s node identifier.",null,null],[3,"Nodes","","",null,null],[3,"Neighbors","","",null,null],[3,"Edges","","",null,null],[12,"from","","**Deprecated: should be private**",0,null],[12,"edges","","**Deprecated: should be private**",0,null],[12,"iter","","**Deprecated: should be private**",0,null],[3,"AllEdges","","",null,null],[0,"graph","daggy::petgraph","`Graph<N, E, Ty, Ix>` is a graph datastructure using an adjacency list representation.",null,null],[6,"DefIndex","daggy::petgraph::graph","",null,null],[8,"IndexType","","Trait for the unsigned integer type used for node and edge indices.",null,null],[10,"new","","",1,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[10,"index","","",1,null],[10,"max","","",1,{"inputs":[],"output":{"name":"self"}}],[11,"zero","","**Deprecated**",1,{"inputs":[],"output":{"name":"self"}}],[11,"one","","**Deprecated**",1,{"inputs":[],"output":{"name":"self"}}],[3,"NodeIndex","","Node identifier.",null,null],[5,"node_index","","Short version of `NodeIndex::new`",null,{"inputs":[{"name":"usize"}],"output":{"name":"nodeindex"}}],[5,"edge_index","","Short version of `EdgeIndex::new`",null,{"inputs":[{"name":"usize"}],"output":{"name":"edgeindex"}}],[3,"EdgeIndex","","Edge identifier.",null,null],[3,"Node","","The graph's node type.",null,null],[12,"weight","","Associated node data.",2,null],[3,"Edge","","The graph's edge type.",null,null],[12,"weight","","Associated edge data.",3,null],[3,"Graph","","`Graph<N, E, Ty, Ix>` is a graph datastructure using an adjacency list representation.",null,null],[3,"WithoutEdges","","An iterator over either the nodes without edges to them or from them.",null,null],[3,"Neighbors","","Iterator over the neighbors of a node.",null,null],[3,"Edges","","Iterator over the edges of a node.",null,null],[3,"NodeWeightsMut","","Iterator yielding mutable access to all node weights.",null,null],[3,"EdgeWeightsMut","","Iterator yielding mutable access to all edge weights.",null,null],[8,"GraphIndex","","A  `GraphIndex` is a node or edge index.",null,null],[3,"WalkEdges","","A “walker” object that can be used to step through the edge list of a node.",null,null],[3,"NodeIndices","","Iterator over the node indices of a graph.",null,null],[3,"EdgeIndices","","Iterator over the edge indices of a graph.",null,null],[0,"dot","daggy::petgraph","Simple graphviz dot file format output.",null,null],[3,"Dot","daggy::petgraph::dot","`Dot` implements output to graphviz .dot format for a graph.",null,null],[4,"Config","","`Dot` configuration.",null,null],[13,"NodeIndexLabel","","Use indices for node labels.",4,null],[13,"EdgeIndexLabel","","Use indices for edge labels.",4,null],[13,"EdgeNoLabel","","Use no edge labels.",4,null],[0,"visit","daggy::petgraph","Graph visitor algorithms.",null,null],[8,"Graphlike","daggy::petgraph::visit","Base trait for graphs that defines the node identifier.",null,null],[16,"NodeId","","",5,null],[8,"NeighborIter","","A graph trait for accessing the neighbors iterator",null,null],[16,"Iter","","",6,null],[10,"neighbors","","Return an iterator that visits all neighbors of the node **n**.",6,null],[3,"AsUndirected","","Wrapper type for walking the graph as if it is undirected",null,null],[12,"0","","",7,null],[3,"Reversed","","Wrapper type for walking edges the other way",null,null],[12,"0","","",8,null],[8,"NeighborsDirected","","NeighborsDirected gives access to neighbors of both `Incoming` and `Outgoing`\nedges of a node.",null,null],[16,"NeighborsDirected","","",9,null],[10,"neighbors_directed","","Return an iterator that visits all neighbors of the node **n**.",9,null],[8,"Externals","","Externals returns an iterator of all nodes that either have either no\nincoming or no outgoing edges.",null,null],[16,"Externals","","",10,null],[10,"externals","","Return an iterator of all nodes with no edges in the given direction",10,null],[8,"VisitMap","","A mapping from node → is_visited.",null,null],[10,"visit","","Return **true** if the value is not already present.",11,null],[10,"is_visited","","",11,null],[8,"Visitable","","Trait for which datastructure to use for a graph’s visitor map",null,null],[16,"Map","","",12,null],[10,"visit_map","","",12,null],[8,"Revisitable","","Trait for graph that can reset & resize its visitor map",null,null],[10,"reset_map","","",13,null],[8,"GetAdjacencyMatrix","","Create or access the adjacency matrix of a graph",null,null],[16,"AdjMatrix","","",14,null],[10,"adjacency_matrix","","",14,null],[10,"is_adjacent","","",14,null],[3,"Dfs","","A depth first search (DFS) of a graph.",null,null],[12,"stack","","The stack of nodes to visit",15,null],[12,"discovered","","The map of discovered nodes",15,null],[3,"DfsIter","","An iterator for a depth first traversal of a graph.",null,null],[3,"Bfs","","A breadth first search (BFS) of a graph.",null,null],[12,"stack","","The queue of nodes to visit",16,null],[12,"discovered","","The map of discovered nodes",16,null],[3,"BfsIter","","An iterator for a breadth first traversal of a graph.",null,null],[3,"Topo","","A topological order traversal for a graph.",null,null],[0,"unionfind","daggy::petgraph","`UnionFind<K>` is a disjoint-set data structure.",null,null],[3,"UnionFind","daggy::petgraph::unionfind","`UnionFind<K>` is a disjoint-set data structure. It tracks set membership of *n* elements\nindexed from *0* to *n - 1*. The scalar type is `K` which must be an unsigned integer type.",null,null],[4,"EdgeDirection","daggy::petgraph","Edge direction",null,null],[13,"Outgoing","","An `Outgoing` edge is an outward edge *from* the current node.",17,null],[13,"Incoming","","An `Incoming` edge is an inbound edge *to* the current node.",17,null],[3,"Directed","","Marker type for a directed graph.",null,null],[3,"Undirected","","Marker type for an undirected graph.",null,null],[8,"EdgeType","","A graph's edge type determines whether is has directed edges or not.",null,null],[10,"is_directed","","",18,{"inputs":[],"output":{"name":"bool"}}],[3,"Ptr","","A reference that is hashed and compared by its pointer value.",null,null],[12,"0","","",19,null],[8,"IntoWeightedEdge","","Convert an element like `(i, j)` or `(i, j, w)` into\na triple of source, target, edge weight.",null,null],[10,"into_weighted_edge","","",20,null],[3,"MinScored","","`MinScored<K, T>` holds a score `K` and a scored object `T` in\na pair for use with a `BinaryHeap`.",null,null],[12,"0","","",21,null],[12,"1","","",21,null],[3,"Bfs","","A breadth first search (BFS) of a graph.",null,null],[12,"stack","","The queue of nodes to visit",16,null],[12,"discovered","","The map of discovered nodes",16,null],[3,"DfsIter","","An iterator for a depth first traversal of a graph.",null,null],[3,"Dfs","","A depth first search (DFS) of a graph.",null,null],[12,"stack","","The stack of nodes to visit",15,null],[12,"discovered","","The map of discovered nodes",15,null],[3,"Graph","","`Graph<N, E, Ty, Ix>` is a graph datastructure using an adjacency list representation.",null,null],[3,"BfsIter","","An iterator for a breadth first traversal of a graph.",null,null],[3,"GraphMap","","`GraphMap<N, E>` is an undirected graph, with generic node values `N` and edge weights `E`.",null,null],[3,"EdgeIndex","daggy","Edge identifier.",null,null],[3,"NodeIndex","","Node identifier.",null,null],[3,"EdgeWeightsMut","","Iterator yielding mutable access to all edge weights.",null,null],[3,"NodeWeightsMut","","Iterator yielding mutable access to all node weights.",null,null],[3,"Dag","","A Directed acyclic graph (DAG) data structure.",null,null],[3,"Children","","A **Walker** type that can be used to step through the children of some parent node.",null,null],[3,"Parents","","A **Walker** type that can be used to step through the children of some parent node.",null,null],[3,"EdgeIndices","","An iterator yielding multiple `EdgeIndex`s, returned by the `Graph::add_edges` method.",null,null],[3,"WouldCycle","","An error returned by the `Dag::add_edge` method in the case that adding an edge would have\ncaused the graph to cycle.",null,null],[12,"0","","",22,null],[0,"walker","","**Walker** is a trait providing a variety of useful methods for traversing graph types.",null,null],[3,"Recursive","daggy::walker","Recursively walks a graph using the recursive function `recursive_fn`.",null,null],[3,"Chain","","Walks the entirety of `a` before walking the entirety of `b`.",null,null],[3,"Filter","","A walker that applies some given predicate to each element returned by its walker.\nThe only index pairs that will be yielded are those that make the predicate evaluate to true.",null,null],[3,"Peekable","","A walker that has a `.peek(&graph)` method that returns an optional next neighbor.",null,null],[3,"SkipWhile","","A walker that invokes the predicate on elements until it returns false. Once the predicate\nreturns false, that element and all further elements are yielded.",null,null],[3,"TakeWhile","","A walker that yields elements so long as the predicate returns true. After the\npredicate returns false for the first time, no further elements will be yielded.",null,null],[3,"Skip","","A walker that skips the first n steps of this walk, and then yields all further steps.",null,null],[3,"Take","","A walker that yields the first n steps of this walk.",null,null],[3,"Cycle","","A walker that repeats its internal walker endlessly.",null,null],[3,"Inspect","","A walker that calls a function with a reference to each index pair before yielding them.\nThis is often useful for debugging a walker pipeline.",null,null],[3,"Iter","","An iterator yielding index pairs produced by its internal walker and graph.",null,null],[3,"IterEdges","","An iterator yielding edge indices produced by its internal walker and graph.",null,null],[3,"IterNodes","","An iterator yielding node indices produced by its internal walker and graph.",null,null],[3,"IterWeights","","An iterator yielding weights associated with the index pairs produced by its internal walker\nand graph.",null,null],[3,"IterEdgeWeights","","An iterator yielding edge weights associated with the indices produced by its internal walker\nand graph.",null,null],[3,"IterNodeWeights","","An iterator yielding node weights associated with the indices produced by its internal walker\nand graph.",null,null],[6,"IndexPair","","Short-hand for an edge node index pair.",null,null],[8,"Walker","","A trait providing a variety of useful methods for traversing some graph type `G`.",null,null],[16,"Graph","","The graph type that the Walker can walk.",23,null],[16,"Index","","The unsigned integer type used for node and edge indices.",23,null],[10,"next","","Fetch the `EdgeIndex` and `NodeIndex` to the next neighbour in our walk through the given\n**Graph**.",23,null],[11,"next_edge","","The next edge in our walk for the given **Graph**.",23,null],[11,"next_node","","The next node in our walk for the given **Graph**.",23,null],[11,"count","","Counts all the steps in the entire walk of the given graph.",23,null],[11,"last","","Walks the whole walk until reaching and returning the last edge node pair.",23,null],[11,"last_edge","","Walks the whole walk until reaching and returning the last edge.",23,null],[11,"last_node","","Walks the whole walk until reaching and returning the last node.",23,null],[11,"nth","","Walks "n" number of steps and produces the resulting edge node pair.",23,null],[11,"nth_edge","","Walks "n" number of steps and produces the resulting edge.",23,null],[11,"nth_node","","Walks "n" number of steps and produces the resulting node.",23,null],[11,"chain","","Produces a walker that will walk the entirey of `self` before walking the entirey of other.",23,null],[11,"filter","","Creates a walker that applies the predicate to each element returned by this walker.\nThe only elements that will be yielded are those that make the predicate evaluate to true.",23,null],[11,"peekable","","Creates a walker that has a `.peek(&graph)` method that returns an optional next neighbor.",23,null],[11,"skip_while","","Creates a walker that invokes the predicate on elements until it returns false. Once the\npredicate returns false, that element and all further elements are yielded.",23,null],[11,"take_while","","Creates a walker that yields elements so long as the predicate returns true. After the\npredicate returns false for the first time, no further elements will be yielded.",23,null],[11,"skip","","Creates a walker that skips the first n steps of this walk, and then yields all further\nsteps.",23,null],[11,"take","","Creates a walker that yields the first n steps of this walk.",23,null],[11,"all","","Tests whether the predicate holds true for all steps in the walk.",23,null],[11,"any","","Tests whether any step in the walk satisfies the given predicate.",23,null],[11,"find","","Returns the first edge node index pair satisfying the specified predicate.",23,null],[11,"find_edge","","Returns the edge index satisfying the specified predicate.",23,null],[11,"find_node","","Returns the node index satisfying the specified predicate.",23,null],[11,"cycle","","Repeats the walker endlessly.",23,null],[11,"fold","","Performs a fold operation over the entire walker, returning the eventual state at the end\nof the walk.",23,null],[11,"inspect","","Creates a walker that calls a function with a reference to each index pair before yielding\nthem. This is often useful for debugging a walker pipeline.",23,null],[11,"iter","","Converts the walker into an iterator yielding index pairs.",23,null],[11,"iter_weights","","Converts the walker into an iterator yielding `(&e, &n)`, where `e` is the edge weight for\nthe next `EdgeIndex` and `n` is the node weight for the next `NodeIndex`.",23,null],[11,"fmt","","",24,null],[11,"clone","","",24,null],[11,"new","","Construct a new **Recursive** **Walker** starting from the node at the given index.",24,{"inputs":[{"name":"nodeindex"},{"name":"f"}],"output":{"name":"self"}}],[11,"next","","",24,null],[11,"fmt","","",25,null],[11,"clone","","",25,null],[11,"next","","",25,null],[11,"fmt","","",26,null],[11,"clone","","",26,null],[11,"next","","",26,null],[11,"fmt","","",27,null],[11,"clone","","",27,null],[11,"peek","","The edge node index pair of the neighbor at the next step in our walk of the given graph.",27,null],[11,"peek_edge","","The edge index of the neighbor at the next step in our walk of the given graph.",27,null],[11,"peek_node","","The node index of the neighbor at the next step in our walk of the given graph.",27,null],[11,"next","","",27,null],[11,"fmt","","",28,null],[11,"clone","","",28,null],[11,"next","","",28,null],[11,"fmt","","",29,null],[11,"clone","","",29,null],[11,"next","","",29,null],[11,"fmt","","",30,null],[11,"clone","","",30,null],[11,"next","","",30,null],[11,"fmt","","",31,null],[11,"clone","","",31,null],[11,"next","","",31,null],[11,"fmt","","",32,null],[11,"clone","","",32,null],[11,"next","","",32,null],[11,"fmt","","",33,null],[11,"clone","","",33,null],[11,"next","","",33,null],[11,"fmt","","",34,null],[11,"clone","","",34,null],[11,"edges","","Convert to an iterator that only yields the edge indices.",34,null],[11,"nodes","","Convert to an iterator that only yields the node indices.",34,null],[11,"next","","",34,null],[11,"fmt","","",35,null],[11,"clone","","",35,null],[11,"next","","",35,null],[11,"fmt","","",36,null],[11,"clone","","",36,null],[11,"next","","",36,null],[11,"fmt","","",37,null],[11,"clone","","",37,null],[11,"edges","","Convert to an iterator yielding only the edge weights.",37,null],[11,"nodes","","Convert to an iterator yielding only the node weights.",37,null],[11,"next","","",37,null],[11,"fmt","","",38,null],[11,"clone","","",38,null],[11,"next","","",38,null],[11,"fmt","","",39,null],[11,"clone","","",39,null],[11,"next","","",39,null],[6,"PetGraph","daggy","The Petgraph to be used internally within the Dag for storing/managing nodes and edges.",null,null],[6,"RawNodes","","Read only access into a **Dag**'s internal node array.",null,null],[6,"RawEdges","","Read only access into a **Dag**'s internal edge array.",null,null],[6,"RecursiveWalk","","An alias to simplify the **Recursive** **Walker** type returned by **Dag**.",null,null],[11,"fmt","","",40,null],[11,"clone","","",40,null],[11,"fmt","","",22,null],[11,"clone","","",22,null],[11,"new","","Create a new, empty `Dag`.",40,{"inputs":[],"output":{"name":"self"}}],[11,"with_capacity","","Create a new `Dag` with estimated capacity for its node and edge Vecs.",40,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"self"}}],[11,"clear","","Removes all nodes and edges from the **Dag**.",40,null],[11,"node_count","","The total number of nodes in the **Dag**.",40,null],[11,"edge_count","","The total number of edgees in the **Dag**.",40,null],[11,"graph","","Borrow the `Dag`'s underlying `PetGraph<N, Ix>`.\nAll existing indices may be used to index into this `PetGraph` the same way they may be\nused to index into the `Dag`.",40,null],[11,"into_graph","","Take ownership of the `Dag` and return the internal `PetGraph`.\nAll existing indices may be used to index into this `PetGraph` the same way they may be\nused to index into the `Dag`.",40,null],[11,"add_node","","Add a new node to the `Dag` with the given weight.",40,null],[11,"add_edge","","Add a new directed edge to the `Dag` with the given weight.",40,null],[11,"add_edges","","Adds the given directed edges to the `Dag`, each with their own given weight.",40,null],[11,"update_edge","","Update the edge from nodes `a` -> `b` with the given weight.",40,null],[11,"find_edge","","Find and return the index to the edge that describes `a` -> `b` if there is one.",40,null],[11,"add_parent","","Add a new edge and parent node to the node at the given `NodeIndex`.\nReturns both the edge's `EdgeIndex` and the node's `NodeIndex`.",40,null],[11,"add_child","","Add a new edge and child node to the node at the given `NodeIndex`.\nReturns both the edge's `EdgeIndex` and the node's `NodeIndex`.",40,null],[11,"node_weight","","Borrow the weight from the node at the given index.",40,null],[11,"node_weight_mut","","Mutably borrow the weight from the node at the given index.",40,null],[11,"raw_nodes","","Read from the internal node array.",40,null],[11,"node_weights_mut","","An iterator yielding mutable access to all node weights.",40,null],[11,"edge_weight","","Borrow the weight from the edge at the given index.",40,null],[11,"edge_weight_mut","","Mutably borrow the weight from the edge at the given index.",40,null],[11,"raw_edges","","Read from the internal edge array.",40,null],[11,"edge_weights_mut","","An iterator yielding mutable access to all edge weights.",40,null],[11,"index_twice_mut","","Index the `Dag` by two indices.",40,null],[11,"remove_node","","Remove the node at the given index from the `Dag` and return it if it exists.",40,null],[11,"remove_edge","","Remove an edge and return its weight, or `None` if it didn't exist.",40,null],[11,"parents","","A **Walker** type that may be used to step through the parents of the given child node.",40,null],[11,"children","","A "walker" object that may be used to step through the children of the given parent node.",40,null],[11,"recursive_walk","","A **Walker** type that recursively walks the **Dag** using the given `recursive_fn`.",40,null],[11,"index","","",40,null],[11,"index_mut","","",40,null],[11,"index","","",40,null],[11,"index_mut","","",40,null],[11,"next","","",41,null],[11,"next","","",42,null],[11,"next","","",43,null],[11,"fmt","","",22,null],[11,"description","","",22,null],[11,"fmt","daggy::petgraph","",21,null],[11,"clone","","",21,null],[11,"eq","","",21,null],[11,"partial_cmp","","",21,null],[11,"cmp","","",21,null],[11,"clone","","",44,null],[11,"fmt","","",44,null],[11,"new","","Create a new `GraphMap`.",44,{"inputs":[],"output":{"name":"graphmap"}}],[11,"with_capacity","","Create a new `GraphMap` with estimated capacity.",44,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"graphmap"}}],[11,"capacity","","Return the current node and edge capacity of the graph.",44,null],[11,"from_edges","","Create a new `GraphMap` from an iterable of edges.",44,{"inputs":[{"name":"i"}],"output":{"name":"graphmap"}}],[11,"node_count","","Return the number of nodes in the graph.",44,null],[11,"edge_count","","Return the number of edges in the graph.",44,null],[11,"clear","","Remove all nodes and edges",44,null],[11,"add_node","","Add node `n` to the graph.",44,null],[11,"remove_node","","Return `true` if node `n` was removed.",44,null],[11,"contains_node","","Return `true` if the node is contained in the graph.",44,null],[11,"add_edge","","Add an edge connecting `a` and `b` to the graph.",44,null],[11,"remove_edge","","Remove edge from `a` to `b` from the graph and return the edge weight.",44,null],[11,"contains_edge","","Return `true` if the edge connecting `a` with `b` is contained in the graph.",44,null],[11,"nodes","","Return an iterator over the nodes of the graph.",44,null],[11,"neighbors","","Return an iterator over the nodes that are connected with `from` by edges.",44,null],[11,"edges","","Return an iterator over the nodes that are connected with `from` by edges,\npaired with the edge weight.",44,null],[11,"edge_weight","","Return a reference to the edge weight connecting `a` with `b`, or\n`None` if the edge does not exist in the graph.",44,null],[11,"edge_weight_mut","","Return a mutable reference to the edge weight connecting `a` with `b`, or\n`None` if the edge does not exist in the graph.",44,null],[11,"all_edges","","Return an iterator over all edges of the graph with their weight in arbitrary order.",44,null],[11,"from_iter","","",44,{"inputs":[{"name":"i"}],"output":{"name":"graphmap"}}],[11,"extend","","",44,null],[11,"next","daggy::petgraph::graphmap","",45,null],[11,"size_hint","","",45,null],[11,"next_back","","",45,null],[11,"next","","",46,null],[11,"size_hint","","",46,null],[11,"next_back","","",46,null],[11,"next","","",0,null],[11,"next","","",47,null],[11,"index","daggy::petgraph","",44,null],[11,"index_mut","","",44,null],[11,"hash","daggy","",48,null],[11,"cmp","","",48,null],[11,"partial_cmp","","",48,null],[11,"lt","","",48,null],[11,"le","","",48,null],[11,"gt","","",48,null],[11,"ge","","",48,null],[11,"eq","","",48,null],[11,"ne","","",48,null],[11,"fmt","","",48,null],[11,"clone","","",48,null],[11,"new","","",48,{"inputs":[{"name":"usize"}],"output":{"name":"nodeindex"}}],[11,"index","","",48,null],[11,"end","","",48,{"inputs":[],"output":{"name":"nodeindex"}}],[11,"from","","",48,{"inputs":[{"name":"ix"}],"output":{"name":"nodeindex"}}],[11,"hash","","",49,null],[11,"cmp","","",49,null],[11,"partial_cmp","","",49,null],[11,"lt","","",49,null],[11,"le","","",49,null],[11,"gt","","",49,null],[11,"ge","","",49,null],[11,"eq","","",49,null],[11,"ne","","",49,null],[11,"clone","","",49,null],[11,"new","","",49,{"inputs":[{"name":"usize"}],"output":{"name":"edgeindex"}}],[11,"index","","",49,null],[11,"end","","An invalid `EdgeIndex` used to denote absence of an edge, for example\nto end an adjacency list.",49,{"inputs":[],"output":{"name":"edgeindex"}}],[11,"fmt","","",49,null],[11,"clone","daggy::petgraph::graph","",2,null],[11,"fmt","","",2,null],[11,"next_edge","","Accessor for data structure internals: the first edge in the given direction.",2,null],[11,"clone","","",3,null],[11,"fmt","","",3,null],[11,"next_edge","","Accessor for data structure internals: the next edge for the given direction.",3,null],[11,"source","","Return the source node index.",3,null],[11,"target","","Return the target node index.",3,null],[11,"clone","daggy::petgraph","",50,null],[11,"fmt","","",50,null],[11,"new","","Create a new `Graph` with directed edges.",50,{"inputs":[],"output":{"name":"graph"}}],[11,"new_undirected","","Create a new `Graph` with undirected edges.",50,{"inputs":[],"output":{"name":"graph"}}],[11,"with_capacity","","Create a new `Graph` with estimated capacity.",50,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"graph"}}],[11,"capacity","","Return the current node and edge capacity of the graph.",50,null],[11,"node_count","","Return the number of nodes (vertices) in the graph.",50,null],[11,"edge_count","","Return the number of edges in the graph.",50,null],[11,"is_directed","","Whether the graph has directed edges or not.",50,null],[11,"add_node","","Add a node (also called vertex) with associated data `weight` to the graph.",50,null],[11,"node_weight","","Access node weight for node `a`.",50,null],[11,"node_weight_mut","","Access node weight for node `a`.",50,null],[11,"add_edge","","Add an edge from `a` to `b` to the graph, with its associated\ndata `weight`.",50,null],[11,"update_edge","","Add or update an edge from `a` to `b`.",50,null],[11,"edge_weight","","Access the edge weight for `e`.",50,null],[11,"edge_weight_mut","","Access the edge weight for `e` mutably.",50,null],[11,"edge_endpoints","","Access the source and target nodes for `e`.",50,null],[11,"remove_node","","Remove `a` from the graph if it exists, and return its weight.\nIf it doesn't exist in the graph, return `None`.",50,null],[11,"remove_edge","","Remove an edge and return its edge weight, or `None` if it didn't exist.",50,null],[11,"neighbors","","Return an iterator of all nodes with an edge starting from `a`.",50,null],[11,"neighbors_directed","","Return an iterator of all neighbors that have an edge between them and `a`,\nin the specified direction.\nIf the graph's edges are undirected, this is equivalent to *.neighbors(a)*.",50,null],[11,"neighbors_undirected","","Return an iterator of all neighbors that have an edge between them and `a`,\nin either direction.\nIf the graph's edges are undirected, this is equivalent to *.neighbors(a)*.",50,null],[11,"edges","","Return an iterator over the neighbors of node `a`, paired with their respective edge\nweights.",50,null],[11,"edges_directed","","Return an iterator of all neighbors that have an edge between them and `a`,\nin the specified direction, paired with the respective edge weights.",50,null],[11,"edges_both","","Return an iterator over the edgs from `a` to its neighbors, then *to* `a` from its\nneighbors.",50,null],[11,"find_edge","","Lookup an edge from `a` to `b`.",50,null],[11,"find_edge_undirected","","Lookup an edge between `a` and `b`, in either direction.",50,null],[11,"without_edges","","Return an iterator over either the nodes without edges to them or from them.",50,null],[11,"node_indices","","Return an iterator over the node indices of the graph",50,null],[11,"node_weights_mut","","Return an iterator yielding mutable access to all node weights.",50,null],[11,"edge_indices","","Return an iterator over the edge indices of the graph",50,null],[11,"edge_weights_mut","","Return an iterator yielding mutable access to all edge weights.",50,null],[11,"raw_nodes","","Access the internal node array.",50,null],[11,"raw_edges","","Access the internal edge array.",50,null],[11,"first_edge","","Accessor for data structure internals: the first edge in the given direction.",50,null],[11,"next_edge","","Accessor for data structure internals: the next edge for the given direction.",50,null],[11,"walk_edges_directed","","Return a “walker” object that can be used to step through the edges\nof the node `a` in direction `dir`.",50,null],[11,"index_twice_mut","","Index the `Graph` by two indices, any combination of\nnode or edge indices is fine.",50,null],[11,"reverse","","Reverse the direction of all edges",50,null],[11,"clear","","Remove all nodes and edges",50,null],[11,"clear_edges","","Remove all edges",50,null],[11,"retain_nodes","","Keep all nodes that return `true` from the `visit` closure,\nremove the others.",50,null],[11,"retain_edges","","Keep all edges that return `true` from the `visit` closure,\nremove the others.",50,null],[11,"from_edges","","Create a new `Graph` from an iterable of edges.",50,{"inputs":[{"name":"i"}],"output":{"name":"graph"}}],[11,"extend_with_edges","","Extend the graph from an iterable of edges.",50,null],[11,"map","","Create a new `Graph` by mapping node and edge weights.",50,null],[11,"filter_map","","Create a new `Graph` by mapping nodes and edges.\nA node or edge may be mapped to `None` to exclude it from\nthe resulting graph.",50,null],[11,"into_edge_type","","Convert the graph into either undirected or directed. No edge adjustments\nare done, so you may want to go over the result to remove or add edges.",50,null],[11,"next","daggy::petgraph::graph","",51,null],[11,"next","","",52,null],[11,"next","","",53,null],[11,"next","daggy","",54,null],[11,"size_hint","","",54,null],[11,"next","","",55,null],[11,"size_hint","","",55,null],[11,"index","daggy::petgraph","",50,null],[11,"index_mut","","",50,null],[11,"index","","",50,null],[11,"index_mut","","",50,null],[11,"index","daggy","",48,null],[11,"is_node_index","","",48,{"inputs":[],"output":{"name":"bool"}}],[11,"index","","",49,null],[11,"is_node_index","","",49,{"inputs":[],"output":{"name":"bool"}}],[11,"fmt","daggy::petgraph::graph","",56,null],[11,"clone","","",56,null],[11,"next","","Fetch the next edge index in the walk for graph `g`.",56,null],[11,"next_neighbor","","Fetch the next edge index and the next node index in the walk for graph `g`.",56,null],[11,"next","","",57,null],[11,"size_hint","","",57,null],[11,"next_back","","",57,null],[11,"next","","",58,null],[11,"size_hint","","",58,null],[11,"next_back","","",58,null],[11,"new","daggy::petgraph::dot","Create a `Dot` formatting wrapper with default configuration.",59,{"inputs":[{"name":"g"}],"output":{"name":"dot"}}],[11,"with_config","","Create a `Dot` formatting wrapper with custom configuration.",59,null],[11,"eq","","",4,null],[11,"ne","","",4,null],[11,"fmt","","",4,null],[11,"fmt","","",59,null],[11,"fmt","","",59,null],[11,"fmt","","",59,null],[11,"fmt","","",59,null],[11,"neighbors","daggy::petgraph","",50,null],[11,"neighbors","","",44,null],[11,"neighbors","daggy::petgraph::visit","",7,null],[11,"neighbors","","",8,null],[11,"neighbors_directed","daggy::petgraph","",50,null],[11,"neighbors_directed","daggy::petgraph::visit","",8,null],[11,"externals","daggy::petgraph","",50,null],[11,"externals","daggy::petgraph::visit","",8,null],[11,"visit_map","daggy::petgraph","",50,null],[11,"reset_map","","",50,null],[11,"reset_map","daggy::petgraph::visit","",8,null],[11,"visit_map","daggy::petgraph","",44,null],[11,"reset_map","","",44,null],[11,"visit_map","daggy::petgraph::visit","",7,null],[11,"visit_map","","",8,null],[11,"adjacency_matrix","daggy::petgraph","",44,null],[11,"is_adjacent","","",44,null],[11,"fmt","","",15,null],[11,"clone","","",15,null],[11,"new","","Create a new **Dfs**, using the graph's visitor map, and put **start**\nin the stack of nodes to visit.",15,{"inputs":[{"name":"g"},{"name":"n"}],"output":{"name":"dfs"}}],[11,"empty","","Create a new **Dfs** using the graph's visitor map, and no stack.",15,{"inputs":[{"name":"g"}],"output":{"name":"dfs"}}],[11,"move_to","","Keep the discovered map, but clear the visit stack and restart\nthe dfs from a particular node.",15,null],[11,"next","","Return the next node in the dfs, or **None** if the traversal is done.",15,null],[11,"new","","",60,null],[11,"move_to","","Keep the discovered map, but clear the visit stack and restart\nthe DFS traversal from a particular node.",60,null],[11,"next","","",60,null],[11,"size_hint","","",60,null],[11,"clone","","",60,null],[11,"clone","","",16,null],[11,"new","","Create a new **Bfs**, using the graph's visitor map, and put **start**\nin the stack of nodes to visit.",16,{"inputs":[{"name":"g"},{"name":"n"}],"output":{"name":"bfs"}}],[11,"next","","Return the next node in the dfs, or **None** if the traversal is done.",16,null],[11,"new","","",61,null],[11,"next","","",61,null],[11,"size_hint","","",61,null],[11,"clone","","",61,null],[11,"clone","daggy::petgraph::visit","",62,null],[11,"new","","Create a new **Topo**, using the graph's visitor map, and put all\ninitial nodes in the to visit list.",62,{"inputs":[{"name":"g"}],"output":{"name":"topo"}}],[11,"reset","","Clear visited state, and put all initial nodes in the to visit list.",62,null],[11,"next","","Return the next node in the current topological order traversal, or\n`None` if the traversal is at end.",62,null],[11,"clone","daggy::petgraph::unionfind","",63,null],[11,"fmt","","",63,null],[11,"new","","Create a new `UnionFind` of `n` disjoint sets.",63,{"inputs":[{"name":"usize"}],"output":{"name":"unionfind"}}],[11,"find","","Return the representative for `x`.",63,null],[11,"find_mut","","Return the representative for `x`.",63,null],[11,"union","","Unify the two sets containing `x` and `y`.",63,null],[11,"into_labeling","","Return a vector mapping each element to its representative.",63,null],[11,"adjacency_matrix","daggy::petgraph","",50,null],[11,"is_adjacent","","",50,null],[11,"eq","","",17,null],[11,"fmt","","",17,null],[11,"clone","","",17,null],[11,"fmt","","",64,null],[11,"clone","","",64,null],[11,"fmt","","",65,null],[11,"clone","","",65,null],[11,"is_directed","","",64,{"inputs":[],"output":{"name":"bool"}}],[11,"is_directed","","",65,{"inputs":[],"output":{"name":"bool"}}],[11,"clone","","",19,null],[11,"eq","","Ptr compares by pointer equality, i.e if they point to the same value",19,null],[11,"partial_cmp","","",19,null],[11,"cmp","","Ptr is ordered by pointer value, i.e. an arbitrary but stable and total order.",19,null],[11,"deref","","",19,null],[11,"hash","","",19,null],[11,"fmt","","",19,null]],"paths":[[3,"Edges"],[8,"IndexType"],[3,"Node"],[3,"Edge"],[4,"Config"],[8,"Graphlike"],[8,"NeighborIter"],[3,"AsUndirected"],[3,"Reversed"],[8,"NeighborsDirected"],[8,"Externals"],[8,"VisitMap"],[8,"Visitable"],[8,"Revisitable"],[8,"GetAdjacencyMatrix"],[3,"Dfs"],[3,"Bfs"],[4,"EdgeDirection"],[8,"EdgeType"],[3,"Ptr"],[8,"IntoWeightedEdge"],[3,"MinScored"],[3,"WouldCycle"],[8,"Walker"],[3,"Recursive"],[3,"Chain"],[3,"Filter"],[3,"Peekable"],[3,"SkipWhile"],[3,"TakeWhile"],[3,"Skip"],[3,"Take"],[3,"Cycle"],[3,"Inspect"],[3,"Iter"],[3,"IterEdges"],[3,"IterNodes"],[3,"IterWeights"],[3,"IterEdgeWeights"],[3,"IterNodeWeights"],[3,"Dag"],[3,"Children"],[3,"Parents"],[3,"EdgeIndices"],[3,"GraphMap"],[3,"Nodes"],[3,"Neighbors"],[3,"AllEdges"],[3,"NodeIndex"],[3,"EdgeIndex"],[3,"Graph"],[3,"WithoutEdges"],[3,"Neighbors"],[3,"Edges"],[3,"NodeWeightsMut"],[3,"EdgeWeightsMut"],[3,"WalkEdges"],[3,"NodeIndices"],[3,"EdgeIndices"],[3,"Dot"],[3,"DfsIter"],[3,"BfsIter"],[3,"Topo"],[3,"UnionFind"],[3,"Directed"],[3,"Undirected"]]};
initSearch(searchIndex);