initSidebarItems({"enum":[["Directed","Marker type for a directed graph."],["EdgeDirection","Edge direction"],["Undirected","Marker type for an undirected graph."]],"mod":[["algo","Graph algorithms."],["dot","Simple graphviz dot file format output."],["graph","`Graph<N, E, Ty, Ix>` is a graph datastructure using an adjacency list representation."],["graphmap","`GraphMap<N, E>` is an undirected graph where node values are mapping keys."],["unionfind","`UnionFind<K>` is a disjoint-set data structure."],["visit","Graph visitor algorithms."]],"trait":[["EdgeType","A graph's edge type determines whether is has directed edges or not."],["IntoWeightedEdge","Convert an element like `(i, j)` or `(i, j, w)` into a triple of source, target, edge weight."]]});