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

"Strongly Connected Components Algorithm - RED"© Coffee Mug

$16.37
$20.46 (20% off)
20% off ends soon
Style
$16.37
$20.46 (20% off)

Product features

  • Taller body and wider mouth to make room for more drink and more art
  • Holds 11.5 US fl. oz. (340 ml)
  • Mug diameter is 2.5" (6.4 cm) at base, widening to 3.6" (9.2 cm) at top, not including handle
  • Dishwasher and microwave safe ceramic
  • Wraparound design printed for you when you order
  • 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

Mugs Tags

This section provides a collection of tags that relate to the Mug on this page. These tags each link to a search for the Mugs that relate to the tag.

All Product Tags

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