Graph, A diagram consisting of circles, called vertices, joined by lines called edges. Each edge joins exactly two vertices, Tree, A connected undirected graph with no cycles, Rooted Tree, A tree in which one vertex has been designated as the root and every edge is directed away from the root, Directed graph, A graph where the edges are directed lines, i.e. arrows, Vertex, An object in a graph - a circle, Edge, A line representing a connection between two vertices in a graph, Neighbours, Two vertices are called neighbours if they are connected by an edge, Degree of a vertex, The number of neighbours a vertex has.

Graphs 1

द्वारा
प्रिंट
एम्बेड

लीडरबोर्ड

दृश्य शैली

विकल्प

टेम्पलेट स्विच करें

ऑटो-सेव पुनःस्थापित करें: ?