SXKDZ
  • Home
  • About Me
  • Links
Subscribe
Tagged

BFS

A collection of 1 post

Algorithm

Algorithm: Breadth-First Search

Recall: Graphs Graph \(G = (V,E)\) \(V\) = set of vertices (arbitrary labels) \(E\) = set of edges, i.e., vertex pairs \((v,w)\) ordered pair \(\Rightarrow\) directed edge of graph unordered pair \(\Rightarrow\) undirected Graph Search Exploring a graph, e.g.: find a path from start vertex \(s\) to a desired

  • SXKDZ
SXKDZ Sep 14, 2016 • 8 min read
SXKDZ © 2023
Powered by Ghost