Module bevy_internal::utils::petgraph::prelude

source ·
Expand description

Commonly used items.

use petgraph::prelude::*;

Structs

  • Bfs
    A breadth first search (BFS) of a graph.
  • Dfs
    Visit nodes of a graph in a depth-first-search (DFS) emitting nodes in preorder (when they are first discovered).
  • DfsPostOrder
    Visit nodes in a depth-first-search (DFS) emitting nodes in postorder (each node after all its descendants have been emitted).
  • EdgeIndex
    Edge identifier.
  • Graph
    Graph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation.
  • GraphMap
    GraphMap<N, E, Ty> is a graph datastructure using an associative array of its node weights N.
  • NodeIndex
    Node identifier.
  • StableGraph
    StableGraph<N, E, Ty, Ix> is a graph datastructure using an adjacency list representation.

Enums

Traits

Type Aliases