| Name | Description | |
|---|---|---|
 | Edges | Obtains a reference to the graph edges |
| IsBiconnected | Determines whether this is a biconnected graph. A biconnected graph is a nonseparable graph, meaning if any vertex were to be removed, the graph will remain connected. |
| IsConnected | Determines whether this is a connected graph (undirected graph) A graph is connected if there is an undirected path between each pair of vertices in it |
| IsCyclic | Determines whether this is a cyclic digraph (directed graph) |
| IsPlanar | Checks whether this graph is planar. |
| IsStronglyConnected | Determines whether this is a strongly connected digraph (directed graph) A digraph is connected if there is a directed path between each pair of vertices in it. |
| IsTree | Determines whether this graph is a tree (directed graph) |
| Vertices | Obtains a reference to the graph vertices |
NevronOpenVision