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

"Strongly Connected Components Algorithm - RED"© Magnet

$6.00
$7.99 (25% off)
25% off ends soon
Size
$6.00
$7.99 (25% off)
  • Super-easy returnsProblem? No problem. We’ll fix it, fast.

Product features

  • Die-cut magnets add a touch of easily switchable flair to your fridge, locker, or file cabinet
  • Available in three sizes
  • Flexible, durable 20mil / 0.5mm vinyl
  • Vibrant color printing
  • Approximately 4mm white border around design
  • WARNING: Choking Hazard small parts. Not for children under 3.
  • This product contains magnets. Swallowed magnets can stick together across intestines causing serious injuries. Seek immediate medical attention if magnets are swallowed.
  • Not a toy. For decorative use only.
  • 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.