Code covered by the BSD License  

Highlights from
Matgraph

from Matgraph by Ed Scheinerman
Toolbox for working with simple, undirected graphs

Description of issparse
Home > matgraph > @graph > issparse.m

issparse

PURPOSE ^

issparse(g) --- check if g's adjacency matrix is sparse

SYNOPSIS ^

function yn = issparse(g)

DESCRIPTION ^

 issparse(g) --- check if g's adjacency matrix is sparse

CROSS-REFERENCE INFORMATION ^

This function calls:
  • issparse issparse(g) --- check if g's adjacency matrix is sparse
This function is called by:
  • bfstree bfstree(t,g,v) --- create a breadth-first spanning tree of g
  • clear_edges clear_edges(g) --- delete all edges of g
  • complement graph complement
  • disjoint_union disjoint_union(g,h,k) --- overwrite g with the disjoint union of the
  • isfull isfull(g) --- check if g's adjacency matrix is full
  • issparse issparse(g) --- check if g's adjacency matrix is sparse
  • save save(g,filename) --- save a graph to disk

SOURCE CODE ^

0001 function yn = issparse(g)
0002 % issparse(g) --- check if g's adjacency matrix is sparse
0003 global GRAPH_MAGIC
0004 yn = issparse(GRAPH_MAGIC.graphs{g.idx}.array);

Generated on Thu 13-Mar-2008 14:23:52 by m2html © 2003

Contact us at files@mathworks.com