Distance (graph theory) | Wikipedia audio article
Channel: wikipedia tts
Date: 27/12/2018

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Distance_(graph_theory)


00:01:36 1 Related concepts
00:06:17 2 Algorithm for finding pseudo-peripheral vertices
00:07:41 3 See also
00:08:05 4 Notes



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.9778395269668899
Voice name: en-US-Wavenet-B


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them.  This is also known as the geodesic distance. Notice that there may be more than one shortest path between two vertices.  If there is no path connecting the two vertices, i.e., if they belong to different connected components, then conventionally the distance is defined as infinite.
In the case of a directed graph the distance 
  
    
      
        d
        (
        u
        ,
        v
        )
      
    
    {\displaystyle d(u,v)}
   between two vertices 
  
    
      
        u
      
    
    {\displaystyle u}
   and 
  
    
      
        v
      
    
    {\displaystyle v}
   is defined as the length of a shortest directed path from 
  
    
      
        u
      
    
    {\displaystyle u}
   to 
  
    
      
        v
      
    
    {\displaystyle v}
   consisting of arcs, provided at least one such path exists. Notice that, in contrast with the case of undirected graphs, 
  
    
      
        d
        (
        u
        ,
        v
        )
      
    
    {\displaystyle d(u,v)}
   does not necessarily coincide with 
  
    
      
        d
        (
        v
        ,
        u
        )
      
    
    {\displaystyle d(v,u)}
  , and it might be the case that one is defined while the other is not.