Module daggy::petgraph::graphmap [−] [src]

GraphMap<N, E> is an undirected graph where node values are mapping keys.

Structs

AllEdges
Edges
GraphMap	`GraphMap<N, E>` is an undirected graph, with generic node values `N` and edge weights `E`.
Neighbors
Nodes
Ptr	A reference that is hashed and compared by its pointer value.

Traits

A trait group for GraphMap's node identifier.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)