Channi Studies

Finding the shortest path between vertices in a graph has many applications. Dijkstra's shortest path algorithm, created by Edsger Dijkstra, determines the shortest path from a start vertex to each vertex in a graph. For each vertex, Dijkstra's algorithm determines the vertex's distance and predecessor pointer.A vertex's distance is the shortest path distance from the start vertex. A vertex's pr..

Vertex and Graph ClassThe Graph class holds a vertex adjacency list using a dictionary that maps a Vertex object to a list of aadjacent Vertex objects.The Vertex class contains a label, but can be augmented by graph algorithms to contain additional data if required. A Graph object is initialized with an empty adjacency list. Vertex objects are created and added to the Graph using the add_vertex(..

A weighted graph associates a weight with each edge.A graph edge's weight, or cost, represents some numerical value between vertex items, such as flight cost between airports, connection speed between computers, or travel time between cities. A weighted graph may be directed or undirected. In a weighted graph, the path length is the sum of the edge weights in the path. The cycle length is t..

A directed graph, or digraph, consists of vertices connected by directed edges. A directed edge is a connection between a starting vertex and a terminating vertex. In a directed graph, a vertex Y is adjacent to a vertex X, if there is an edge from X to Y. Many graphs are directed, like those representing links between web pages, maps for navigation, or college course prerequisites. From above di..