Duplicate edges not supported. Specify ''omitselfloops'' only once. Invalid option combination. Specify ''upper'' or ''lower''. Node information must be a string vector, cell array of character vectors, a table, or a number of nodes. Number of nodes argument not supported when edges are specified as node names. Edge properties must not contain an EndNodes variable. Not enough input arguments. Direct editing of edges is not supported. Use addedge or rmedge instead. Invalid data type. Adjacency matrix must be double, single, or logical. Edge properties must be a table. Node IDs must both be numeric vectors, both be node names (specified as string vectors, character vectors, or cell arrays of character vectors), or both be categoricals. Option must be ''omitselfloops''. Option must be ''upper'', ''lower'', or ''omitselfloops''. Node names must not contain missing string (shown as <missing>). Node names must not contain undefined categoricals (shown as <undefined>). Categorical arrays must both be ordinal or both not be ordinal. Ordinal categorical arrays must have the same categories, including their order. Numeric node IDs must be positive integers not greater than the number of nodes in the graph ({0}). Number of node names must match size of adjacency matrix. Number of rows in nodes table must match size of adjacency matrix. Edge list contains a name not present in the node names argument. Not enough node names specified. Specify at least {0} names. Number of nodes specified is too small. Specify at least {0} nodes. Number of nodes specified must be real, finite, and nonnegative. Number of rows in nodes table is too small. Specify at least {0} rows. Weight must have as many elements as edge list or be a scalar. First variable in edge information table must be called EndNodes. First variable in edge information table must be a 2-column array (numeric, cell, or string) of node names. Graph edge weights must be double or single, real, and not sparse. Name variable in node table must have one column. Node names must be a string vector or a cell array of character vectors. Node table must have a Name variable. Node names must be unique. Weight must be a column vector with as many entries as there are edges in the graph. Indexing not supported. Node information must be a table when edge information is a table. Direct editing of edges not supported. Use addedge or rmedge instead. Direct editing of nodes not supported. Use addnode or rmnode instead. Adjacency matrix must be square. Adjacency matrix must be symmetric. Alternatively, use option 'upper' or 'lower' to ignore part of the input matrix. Input graph must be directed. In-degree of nodes is not supported for undirected graphs. Use degree instead. By convention, nodes in an undirected graph only have outgoing edges. Use outedges instead. Out-degree of nodes is not supported for undirected graphs. Use degree instead. Node predecessors are not supported for undirected graphs. Use neighbors instead. Node successors are not supported for undirected graphs. Use neighbors instead. Graph does not contain a node named ''{0}''. Unable to load graph because it is incompatible with this version of MATLAB.