Login
    Thumbnail 1 of 3, Poster, "Strongly Connected Components Algorithm - PURPLE"© designed and sold by LisaCClark.
    Thumbnail 2 of 3, Poster, "Strongly Connected Components Algorithm - PURPLE"© designed and sold by LisaCClark.
    Thumbnail 3 of 3, Poster, "Strongly Connected Components Algorithm - PURPLE"© designed and sold by LisaCClark.
    Poster, "Strongly Connected Components Algorithm - PURPLE"© designed and sold by LisaCClark

    "Strongly Connected Components Algorithm - PURPLE"© Poster

    $15.72
    $19.64 (20% off)
    20% off ends in
    04H
    20M
    05S
    Style
    Poster
    PosterHeavy poster paper, semigloss finish
    Size
    Finish
    $15.72
    $19.64 (20% off)
    • Super-easy returnsProblem? No problem. We’ll fix it, fast.

    Product features

    • Printed on poster paper. Extremely versatile, making it perfect for reproducing both artwork and photographs
    • Custom sizes, based on artwork dimensions. Check size chart if self-framing
    • Dimensions include a 1 - 2 inch (2.5 - 5.0cm) white border to assist in framing
    • Shipped in protective packaging
    • 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 - PURPLE"© by Lisa Clark - Thinker Collection STEM Art and MORE
    "Strongly Connected Components Algorithm - PURPLE"©
    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.