edges2graph

License

function G = edges2graph(E,nnodes)

%EDGES2GRAPH Create an undirected, simple graph from edge list.
%
%   G = EDGES2GRAPH(E) creates an adjaceny matrix for the graph where
%   E(k,1) and E(k,2) specifies the kth edge. All edges are treated as
%   undirected. Duplicate edges are removed. Loops are removed.
%
%   G = EDGES2GRAPH(E,N) specifies the number of number of nodes in the
%   graph.
%
% Tamara G. Kolda, Ali Pinar, and others, FEASTPACK v1.1, Sandia National
% Laboratories, SAND2013-4136W, http://www.sandia.gov/~tgkolda/feastpack/,
% January 2014

License

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL85000.

if ~exist('nnodes','var')
    nnodes = max(E(:));
else
    % Error checking only
    tmp = max(E(:));
    if (tmp > nnodes)
        fprintf('Highest index in E is %d, but N = %d', tmp, nnodes);
    end
end

ii = E(:,1);
jj = E(:,2);
G = spones(sparse([ii;jj],[jj;ii],1,nnodes,nnodes));
G = spdiags(zeros(nnodes,1),0,G);

Contents

License