Thumbnail 1 of 4, iPhone Case, "Strongly Connected Components Algorithm - RED"© designed and sold by LisaCClark.
Thumbnail 2 of 4, iPhone Case, "Strongly Connected Components Algorithm - RED"© designed and sold by LisaCClark.
Thumbnail 3 of 4, iPhone Case, "Strongly Connected Components Algorithm - RED"© designed and sold by LisaCClark.
Thumbnail 4 of 4, iPhone Case, "Strongly Connected Components Algorithm - RED"© designed and sold by LisaCClark.
iPhone Case, "Strongly Connected Components Algorithm - RED"© designed and sold by LisaCClark

"Strongly Connected Components Algorithm - RED"© iPhone Case

$39.12
Model
Case Style
$39.12
  • Super-easy returnsProblem? No problem. We’ll fix it, fast.

Product features

  • Double layer clip-on protective case with extra durability
  • Impact resistant polycarbonate shell and shock absorbing inner TPU liner
  • Super-bright colors embedded directly into the case
  • Secure fit with design wrapping around side of the case and full access to ports
  • Compatible with Qi-standard wireless charging
  • iPhone SE (2020) / iPhone 8 cases also fit iPhone SE (2022)
  • Weight 30g
  • Thickness 1/8 inch (3mm)
  • Since every item is made just for you by your local third-party fulfiller, there may be slight variances in the product received
Artwork thumbnail, "Strongly Connected Components Algorithm - RED"© by Lisa Clark - Thinker Collection STEM Art and MORE
"Strongly Connected Components Algorithm - RED"©
HOW STRONGLY ARE YOUR COMPONENTS CONNECTED? A graph theory algorithm that finds strongly connected components of a graph, discovered by Robert Tarjan. The algorithm takes a directed graph as input, and partitions its vertices into strongly connected components with each appearing in exactly one of the strongly connected components. Any vertex that is not on a directed cycle forms a strongly connected component all by itself. It goes like this: Start a first-depth search from an arbitrary start node visiting every other one exactly once. This creates search trees that become a graph forest. The strongly connected components will be recovered as certain subtrees of this forest, with their roots the "roots" of the strongly connected components. Any node of a strongly connected component might be a root, if it happens to be the first of the component discovered in search. (Wiki) www.ThinkerCollection.com. © 2016 Textiles for Thinkers, LLC. All Rights Reserved.

Also available on

Related Tags

All Product Tags

This section provides a collection of tags that each link to a search for any products that relate to the tag.