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

    "Strongly Connected Components Algorithm - RED"© Zipper Pouch

    $15.91
    $13.52 when you buy any 2+
    $13.52 when you buy any 2+
    Size
    $15.91
    • Super-easy returnsProblem? No problem. We’ll fix it, fast.

    Product features

    • Your rugged little personal valet: carry your makeup, pencils, phone, cards, anything
    • Available in three sizes: check the size chart to find the right one for you
    • Durable 100% polyester canvas with a metal zipper. Fully lined for added strength
    • Vibrant, high-quality double-sided design, printed for you when you order
    • Cold machine wash and low tumble dry
    • 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.