logotransparent.png

Legion of Learners

www.lol-101.com

  • Home

  • Classrooms

  • Courses

  • About Us

    • Executive Team
    • Board Members
  • Resources

  • More

    Use tab to navigate through the menu items.
    To see this working, head to your live site.
    • Categories
    • All Posts
    • My Posts
    sfolax6776
    vor 6 Tagen
      ·  Edited: vor 6 Tagen

    ACSL Elementary - Graph Theory 2

    in CS Fundamentals for ACSL

    A. Notes

    1. A path between two vertices in a graph is a list of vertices, in which successive vertices are connected by edges in the graph.

    2. The length of a path is the number of edges on the path.

    3. A simple path is a path with no vertex repeated.

    4. A graph is connected if if there is a path from every vertex to every other vertex in the graph.

    5. A graph is traversable if you can draw a path between all the vertices without retracing the same path. Obviously, a traversable graph is connected.

    B. HW

    1. In the graph below, how many paths can you find from A to D? Is this graph connected?

    How many simple paths from A to F are there? Is this graph traversable?


    2. In the graph below, what is the longest simple path? Is this graph traversable? If you can add an edge, can you make the graph traversable?


    2 comments
    0
    ygou88
    vor 6 Tagen  ·  Edited: vor 1 Tag
    1. 10, no, 5, no

    2. v u w z x y, no, no

    0
    jyao.coding
    vor 4 Tagen
    1. 10, no, 5, no

    2. vuwzxy, no, no

    0
    2 comments

    Questions? Email us at legionoflearners@gmail.com or join our WeChat group!

    • lol-101dotcom

    ©2020 Legion of Learners