Graph Algorithms

What are the vertices and edges of a graph?

A graph G = (V, E) is a set of vertices (nodes) V together with a set of edges E, where each edge connects a pair of ver

What is the degree of a vertex in an undirected graph?

The degree of a vertex is the number of edges incident to it (a self-loop usually counts twice). By the handshaking lemm

What are in-degree and out-degree in a directed graph?

In a directed graph, the in-degree of a vertex is the number of edges pointing into it, and the out-degree is the number

What distinguishes a directed graph from an undirected graph?

In an undirected graph an edge {u, v} is symmetric and traversable both ways. In a directed graph (digraph) an edge (u,

What is a weighted graph?

A weighted graph assigns a numeric weight (cost, length, or capacity) to each edge (or vertex). Many algorithms such as