Category: Data Structure

In a directed graph, for any node v, the number of edges, which have v as their initial node, is called the out degree of the node v. Outdegree: Number of edges having the node v as root node is the outdegree of the node v.

A graph in which weights are assigned to every edge is called a weighted graph.

A simple graph is a graph, which has not more than one edge between a pair of nodes.

An edge of a graph, which connects to itself, is called a loop or sling.

A graph in which every edge is undirected is called an undirected graph.

A graph in which every edge is directed is called a directed graph.

Any two nodes, which are connected by an edge in a graph, are called adjacent nodes. For example, if an edge x E is associated with a pair of nodes (u,v) where u, v V, then we say that the edge x connects the nodes u and v.

The adjacency –matrix is an n x n matrix A whose elements aij are given by aij = 1 if (vi, vj) Exists       =0 otherwise

A graph G consist of a nonempty set V which is a set of nodes of the graph, a set E which is the set of edges of the graph, and a mapping from the set of edges E to set of pairs of elements of V. It can also be represented as G=(V, E).

A graph in which weights are assigned to every edge is called a weighted graph.