lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

index.md (499B)

      1 +++
      2 title = 'Paths'
      3 +++
      4 # Paths
      5 **Trees**
      6 
      7 Simple, undirected, connected, acyclic graphs. Any two vertices are connected by exactly one path. Must have *n-1* edges if *n *vertices.
      8 
      9 ![screenshot.png](d3b66b27d68752421b0281c6ab69fcff.png)
     10 
     11 **Eulerian path**
     12 
     13 A path that visits *every edge* exactly once. It is a cycle if it starts and ends on the same vertex.
     14 
     15 **Hamiltonian graph**
     16 
     17 A path in a graph that visits *each vertex* exactly once. It is a cycle if it starts and ends on the same vertex.