Directed network

A network whose links have orientations, so a connection from one node to another need not imply a connection in the reverse direction.

Connect

Directed graph: A set of vertices joined by edges that each have a specified direction. Its oriented edges give the network its defining structure.
Graph theory: The mathematical study of graphs, structures made of vertices and edges. Directed networks are graph-theoretic structures with an orientation rule.
Citation network: A network in which publications link to works they cite. Citations point from citing works to cited works, creating directional scholarly relationships.
Undirected graph: A graph whose edges connect pairs of vertices without assigning a direction. Its links are symmetric, unlike the potentially one-way links here.
Adjacency matrix: A square matrix recording which pairs of vertices in a graph are adjacent. Its entries encode each directed connection by its ordered source and destination.
Vertex (graph theory): An individual point in a graph, also called a node. Vertices are the entities connected by the network's oriented links.
Web graph: A graph whose vertices are web pages and whose directed edges are hyperlinks. A hyperlink can point one way without a return link.
Mixed graph: A graph containing both directed and undirected edges. It combines oriented links with connections that have no assigned orientation.
Reachability: The property that a vertex can be reached from another by following graph edges. Direction determines which vertices can be reached by directed paths.
Edge (graph theory): A connection between vertices in a graph. An edge becomes directed when its source and destination are distinguished.