Search:
MATLAB Central
File Exchange
Answers
Newsgroup
Link Exchange
Blogs
Trendy
Cody
Contest
MathWorks.com
Log In
Create Account
Log In
File Exchange
Answers
Newsgroup
Link Exchange
Blogs
Trendy
Cody
Contest
MathWorks.com
Download All
Code covered by the
BSD License
Highlights from
Matgraph
Checking graph isormorphism i...
Coloring graphs in Matgraph
Creating a Cayley graph
Domination in graphs
Eulerian tours
Finding and displaying Hamilt...
Finding spanning trees
Lower bound for the Ramsey nu...
Matchings in bipartite graphs
Partitions in Matgraph
Permutations in Matgraph
Splitting the vertex set of a...
check_matrix(A)
check_matrix(A) --- check if A is a valid adjacency matrix for a graph
edraw(g,elist)
find_available
idx = find_available
free_all
free_all --- delete all graphs from the GRAPH_MAGIC system
genhtml
generate matgraph html documentation using m2html
graph_destroy
destroy the GRAPH_MAGIC system
graph_init(capacity)
graph_init(capacity) --- used to initialize the GRAPH_MAGIC data
graph_system_exists
graph_system_exists checks to see if the GRAPH_MAGIC global structure has
matgraph_version
Report which version of MATGRAPH is being used.
max_available
num_available --- maximum number of graphs we can hold in this system
num_available
num_available --- number of free slots in the graph system
set_large(n)
swap(a,b)
graph(n)
graph: constructor for the graph class
partition(param)
partition --- constructor for the partition class
permutation(n)
constructor for the permutation class
Description of across
Description of add
Description of alpha
Description of array
Description of array
Description of bfstree
Description of bipartition
Description of bipmatch
Description of bridges
Description of bucky
Description of cartesian
Description of cayley
Description of cdraw
Description of check
Description of check_matrix
Description of chromatic_poly
Description of circulant
Description of clear_edges
Description of clear_labels
Description of color
Description of complement
Description of complete
Description of component
Description of components
Description of contract
Description of copy
Description of copy_labels
Description of cube
Description of cycle
Description of cycles
Description of deg
Description of delete
Description of dfstree
Description of diam
Description of disjoint_union
Description of display
Description of display
Description of display
Description of dist
Description of distxy
Description of dodecahedron
Description of dom
Description of dot
Description of draw
Description of draw_labels
Description of edge_color
Description of edges
Description of embed
Description of eq
Description of eq
Description of eq
Description of euler_trail
Description of fast_set_matrix
Description of find_available
Description of find_path
Description of free
Description of free_all
Description of full
Description of genhtml
Description of get_label
Description of getxy
Description of graffle
Description of graph
Description of graph_destroy
Description of graph_init
Description of graph_system_e...
Description of grid
Description of hamiltonian_cy...
Description of has
Description of has_path
Description of hasxy
Description of icosahedron
Description of incidence_matr...
Description of induce
Description of intersect
Description of interval_graph
Description of inv
Description of is_labeled
Description of isconnected
Description of isfull
Description of iso
Description of issparse
Description of join
Description of label
Description of laplacian
Description of ldraw
Description of length
Description of line_graph
Description of load
Description of longest_cycle
Description of make_logical
Description of match_join
Description of matgraph_versi...
Description of matrix
Description of matrix
Description of max_available
Description of mdsxy
Description of merge
Description of mobius
Description of mpower
Description of mtimes
Description of mtimes
Description of mtimes
Description of mycielski
Description of nauty
Description of ndraw
Description of ne
Description of ne
Description of ne
Description of neighbors
Description of np
Description of nsptrees
Description of num_available
Description of nv
Description of nv
Description of octahedron
Description of omega
Description of paley
Description of partition
Description of parts
Description of path
Description of permutation
Description of petersen
Description of plus
Description of plus
Description of prufer
Description of random
Description of random
Description of random_biparti...
Description of random_planar
Description of random_regular
Description of random_tree
Description of randxy
Description of renumber
Description of resistance
Description of resize
Description of rmxy
Description of save
Description of scale
Description of selective
Description of set_large
Description of set_matrix
Description of sgf
Description of shiftgraph
Description of sign
Description of size
Description of size
Description of size
Description of sl2graph
Description of slot
Description of sparse
Description of split
Description of sprandom
Description of springxy
Description of spy
Description of subsref
Description of subsref
Description of subsref
Description of swap
Description of thresh
Description of trim
Description of uminus
Description of union
Description of vertex_degree_...
Description of wheel
Index for Directory matgraph
Index for Directory matgraph/...
Index for Directory matgraph/...
Index for Directory matgraph/...
Matgraph Samples
Matlab Index
View all files
from
Matgraph
by
Ed Scheinerman
Toolbox for working with simple, undirected graphs
Index for Directory matgraph
Master index
Index for matgraph
Index for matgraph
Matlab files in this directory:
check_matrix
check_matrix(A) --- check if A is a valid adjacency matrix for a graph
find_available
idx = find_available
free_all
free_all --- delete all graphs from the GRAPH_MAGIC system
genhtml
generate matgraph html documentation using m2html
graph_destroy
destroy the GRAPH_MAGIC system
graph_init
graph_init(capacity) --- used to initialize the GRAPH_MAGIC data
graph_system_exists
graph_system_exists checks to see if the GRAPH_MAGIC global structure has
matgraph_version
Report which version of MATGRAPH is being used.
max_available
num_available --- maximum number of graphs we can hold in this system
num_available
num_available --- number of free slots in the graph system
set_large
set_large(n) --- set the cut off size for large graphs.
swap
swap(a,b) -- return a permutation that swaps a and b, i.e., (a,b)
Subsequent directories:
@graph
@partition
@permutation
doc
html
samples
tools
Generated on Thu 13-Mar-2008 14:23:49 by
m2html
© 2003
Contact us at
files@mathworks.com