Skip to contents

A directed graph is strongly connected if any two nodes are connected via paths in both directions.

Usage

IsStronglyConnected(arcSources, arcTargets, numNodes)

Arguments

arcSources

Vector corresponding to the source nodes of a graph's edges

arcTargets

Vector corresponding to the destination nodes of a graph's edges

numNodes

The number of nodes in the graph

Value

A logical stating if the graph is strongly connected