DirectedGraphQ

DirectedGraphQ[g]

yields True if the graph g is a directed graph and False otherwise.

Details

  • A graph is directed if every edge in the graph is directed.

Examples

open allclose all

Basic Examples  (2)

Test whether a graph is directed:

DirectedGraphQ gives False for inputs that are not directed graphs:

Scope  (6)

DirectedGraphQ works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

DirectedGraphQ gives False for anything that is not a directed graph:

DirectedGraphQ works with large graphs:

Properties & Relations  (3)

A directed graph can have self-loops:

A nonsymmetric adjacency matrix corresponds to a directed graph:

The incidence matrix of a directed graph has at least one entry that is -1:

Possible Issues  (1)

DirectedGraphQ gives False for non-explicit graphs:

Wolfram Research (2010), DirectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/DirectedGraphQ.html.

Text

Wolfram Research (2010), DirectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/DirectedGraphQ.html.

CMS

Wolfram Language. 2010. "DirectedGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/DirectedGraphQ.html.

APA

Wolfram Language. (2010). DirectedGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DirectedGraphQ.html

BibTeX

@misc{reference.wolfram_2024_directedgraphq, author="Wolfram Research", title="{DirectedGraphQ}", year="2010", howpublished="\url{https://reference.wolfram.com/language/ref/DirectedGraphQ.html}", note=[Accessed: 21-December-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_directedgraphq, organization={Wolfram Research}, title={DirectedGraphQ}, year={2010}, url={https://reference.wolfram.com/language/ref/DirectedGraphQ.html}, note=[Accessed: 21-December-2024 ]}