# isConnected -- determines whether a graph is connected

## Synopsis

• Usage:
C = isConnected G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• C, , whether a graph is connected

## Description

A graph is connected when there exists a path of edges between any two vertices in the graph.

 i1 : G = graph({{1,2},{2,3},{3,4},{5,6}},EntryMode=>"edges"); i2 : isConnected G;