m
mixed graph
Graph that is permitted to contain both directed and undirected edges
EntityQ17104046
- Subclass of
Overview
On other databases
5 identifiers linking mixed graph across the web's reference databases
Graph that is permitted to contain both directed and undirected edges
5 identifiers linking mixed graph across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In graph theory, a mixed graph G = (V, E, A) is a graph consisting of a set of vertices V, a set of (undirected) edges E, and a set of directed edges (or arcs) A.