Bidirected graph
id:
bidirected-graph-194-16453646
title:
Bidirected graph
text:
In the mathematical domain of graph theory, a bidirected graph is a graph in which each edge is given an independent orientation at each end. Thus, there are three kinds of bidirected edges: those where the arrows point outward, towards the vertices, at both ends; those where both arrows point inward, away from the vertices; and those in which one arrow points away from its vertex and towards the opposite end, while the other arrow points in the same direction as the first, away from the opposit
brand slug:
wiki
category slug:
encyclopedia
description:
Graph whose edges are given independent directions at both ends
original url:
https://en.wikipedia.org/wiki/Bidirected_graph
date created:
date modified:
2023-08-11T17:59:19Z
main entity:
{"identifier":"Q4904180","url":"https://www.wikidata.org/entity/Q4904180"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/6/68/Bidirected_graph_features.svg","width":414,"height":207}
fields total:
13
integrity:
15