(optional) set of edges or arcs of the (di)graph
GraphRank returns rank of a graph G which is the number of vertices minus the number of connected components of G. If a set of edges (arcs) E of the (di)graph is specified, then the rank is number of vertices minus the number of connected components of the spanning subgraph of G with edge set E.
G ≔ Graph⁡1,2,3,4,4,5:
Download Help Document
What kind of issue would you like to report? (Optional)