How to Paint Your Way out of a Maze

Loading...

Flash Player 9 (or above) is needed to view presentations.
We have detected that you do not have it on your computer. To install it, go here.

0 comments

Post a comment

    Post a comment
    Embed Video
    Edit your comment Cancel

    Favorites, Groups & Events

    How to Paint Your Way out of a Maze - Presentation Transcript

    1. How to Paint Your Way out of a Maze Prof. Joshua Holden, Rose-Hulman Inst. of Tech. Joint work with Lana Holden How to Paint Your Way out of a Maze – p. 1/3
    2. Graphs and Digraphs DefinitionA (loop-free) graph is a set of vertices, V , and a set of edges, E, where each edge is an unordered pair of distinct vertices. Definition A (loop-free) digraph is a set of vertices, V , and a set of edges, E, where each edge is an ordered pair of distinct vertices. (The order is thought of as indicating a “direction”.) How to Paint Your Way out of a Maze – p. 2/3

    + Joshua HoldenJoshua Holden, 2 years ago

    custom

    653 views, 0 favs, 0 embeds more stats

    Many people don't realize that what we now call "al more

    More info about this document

    © All Rights Reserved

    Go to text version

    • Total Views 653
      • 653 on SlideShare
      • 0 from embeds
    • Comments 0
    • Favorites 0
    • Downloads 9
    Most viewed embeds

    more

    All embeds

    less

    Flagged as inappropriate Flag as inappropriate
    Flag as inappropriate

    Select your reason for flagging this presentation as inappropriate. If needed, use the feedback form to let us know more details.

    Cancel
    File a copyright complaint
    Having problems? Go to our helpdesk?

    Categories