edge (graph theory)

In graph theory, an edge means a part of a graph. An edge indicates whether two nodes are related, or whether they are connected in the pictorial representation of the graph. In a directed graph, an edge is an ordered pair of nodes in an undirected graph is an edge of a lot of two nodes. Two nodes are connected by an edge adjacent hot or adjazent.

Edge species and their notation

Undirected edges

Edges in an undirected graph is called undirected edges. An undirected edge is therefore a set of two nodes. Sometimes the term is also extended to directed graphs, to express that two nodes A and B are connected by both the edge and by the edge.

Directed edges

Edges in a directed graph is called a directed edge. Thus, it has an orientation as opposed to a non-directional edge. For an edge node of the start node and the node end node of the edge is called. A directed edge is also called bow or arrow. Two edges with hot and opposite or antiparallel.

Special edges

Generalization: hyperedge

In hypergraph, an edge as so-called hyperedge also connect more than two nodes.