{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

11f6643lec26 - CS 6643 F'11 Lec 26 G=(V,E,w is a weigthed...

Info icon This preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Graph Algorithms Definitions • G=(V,E) – V is a set of vertices or nodes – E is a set of edges with each edge connecting two vertices » Edges are denoted as 2-tuples (u,v), where u, v V – G is an undirected graph is edges are unordered 2-tuples – G is a directed graph if edges are ordered 2-tuples Undirected edge (u,v) is incident on vertices u and v – u and v are adjacent to each other – Directed edge (u,v) is incident from u to v, and v is adjacent to u A path from u to v is a sequence <v 0 , v 1 , …, v k > of vertices, where v 0 = u and v k =v and (v i ,v i+1 ) E for 0 i<k Length of the path is then number edges in the path CS 6643 F '11 Lec 26 2 Definitions Path (u,v) – Exists if v is reachable from u – Is simple if all intermediate vertices are distinct – Is a cycle if v 0 = v k G is connected if there is a path from any vertex to any other vertex A complete graph has all possible edges – Every vertex is adjacent to all other vertices A forest is an acyclic graph A tree is a connected acyclic graph A weighted graph has weights for each edge – G=(V,E,w) is a weigthed graph such that w: E-> is a valid function CS 6643 F '11 Lec 26 3 Definitions Adjacency matrix, A=(a i,j
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern