Modified & Generalized Dunn's index by Nejc Ilc

An implementation of Modified and Generalized Dunn's index for internal cluster validation. (clustering, validation, dunns index)

DI=indexDN(data,labels,distance)

[G,d,uniqueInd]=graph_create(data,labels,graph_type,options...

[fig]=scatterPlot(data,labels,options)

Find Network Components by Daniel Larremore

Find network components, sizes, and lists of member nodes. (network, graph theory, component)

networkComponents(A)

Segmentation of retinal layers in OCT images with graph theory by ted teng

Demonstrates segmentation of retinal layers in OCT images with graph theory. (image processing, graph theory, ophthalmology)

graphkshortestpaths( G, S, T, K )

octGraphTheoryDemo.m

MATLAB Contest - Knots by The MATLAB Contest Team

All the files needed to develop and score an entry for the MATLAB® Programming Contest. (contest, graph theory, networks)

getComplexity(filename)

grade(XYnew, A, XYold, wts)

runcontest(flagVisualize,whichPuzzles)

Graph manipulation by Arsen Arakelyan

These four files are intended for adding/deleting nodes and edges in biograph object (graphs, graph theory, graph manipulation)

edge_add(bg,Source, Sink, edge_col)

edge_del(bg, SourceInd, SinkInd)

node_add(bg, node_pos, node_size, UserData)

Connectivity check for undirected graphs. by Twan Burg

For an adjacency matrix it checks if the vertices are connected with each other. Also other files. (graph theory)

conncheckie=checkc(g)

conncheckie=checkcc(g,i)

sizegreatestgroup=bigcong(g)

Bron-Kerbosch maximal independent set and maximal clique algorithms by Berk Birand

Lists all the maximal independent sets and the maximal cliques of a graph (bronkerbosch, maximal stable set, matgraph)

BK_MaxClique( int_matrix )

BK_MaxIS( int_matrix )

._BK_MaxClique.m

stable matching by Hanan Kavitz

Straightforward implementation of Gale-Shapley "stable marriage" algorithm. (stable marriage, galeshapley, stable matching)

match=stableMatching(mPref,wPref)

stableMatchingDriver.m

Bron-Kerbosch maximal clique finding algorithm by Jeffrey Wildman

Implementation of the Bron-Kerbosch algorithm to find all maximal cliques of an undirected graph. (bronkerbosch, maximal, clique)

maximalCliques( A, v_str )

Cops and Robber Software by Athanasios Kehagias

Functions to compute optimal schedules for a team of cops chasing a robber on a graph (mathematics, pursuit evasion, graph theory)

P=grf2P01(fname)

[EC,ER]=CRcheq(C,R,P)

[F,CT,DCT,mopta,moptd]=CRcod(Ca,Ra,Cd)

Largest Component by Puck Rombach

Takes an adj. matrix of a network and outputs a list of the nodes in its largest connected component (mathematics, graph theory, network)

largestcomponent(A)

grTheory - Graph Theory Toolbox by Sergii Iglin

28 functions for different tasks of graph theory (clique, graph theory, tree)

BG=grBase(E)

CBG=grCoBase(E)

CoCycles=grCoCycleBasis(E)

the Network Simplex Algorithm by Naomichi Aoyama

the Network Simplex Algorithm (optimization, graph theory, network)

admissible( f )

cy( A,i,j )

edge( L,n )

TRUTH TABLE by Abhishek Chakraborty

Creates a Logical Truth Table Matrix for 'N' Input Variables. (logical, boolean, mathematics)

TruthTable(N)

Hypergraph edge/vertex matrix by Marcos Bolanos

Convert binary undirected adjacency matrix into a hypergraph matrix. (hypergraph, clusters, adjacency matrix)

Hyper.m

FIND ALL THE POSSIBLE PATHS BETWEEN A START AND AN END NODE OF A GRAPH by Abhishek Chakraborty

Graph Theory, Finds all the possible paths between source and sink node. (communications, power systems, graph theory)

PathFinal=PathFinder(B,StartNode,EndNode)

Toolbox Graph by Gabriel Peyre

A toolbox to perform computations on graph. (graph theory, meshes, combinatorial)

Toolbox graph - A toolbox to process graph and triangulated...

Isomap(D,ndims,options);

adjacency2incidence(A)

Maximum Weight Spanning tree (Undirected) by Guangdi Li

Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here. (spanning tree, data mining, graph theory)

UndirectedMaximumSpanningTree (CostMatrix)

ControlCentor.m

getOdC by Santiago Balestrini

Computes the Off-Diagonal Complexity as defined by J.C. Claussen. (claussen, offdiagonal complexit..., mathematics)

getOdC(g)

MatlabBGL by David Gleich

MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. (bfs, dfs, a star)

A=erdos_reyni(n,p)

[d pred f]=astar_search(A,s,h,varargin)

[is_planar ksubgraph EI]=boyer_myrvold_planarity_test(A,var...

gplot3 by Ali Mohammad Razeghi

Plot graph, as in "graph theory" in three dimensions. (plot3, gplot3, graph theory)

[Xout,Yout,Zout]=gplot3(A,xy,lc)

Matgraph by Ed Scheinerman

Toolbox for working with simple, undirected graphs (graphs, undirected, graph theory)

Checking graph isormorphism in Matgraph

Coloring graphs in Matgraph

Creating a Cayley graph

MINCONNECT by Vassili Pastushenko

adjacency matrix/plot of minimally connected X,Y points (optimization, graph theory, optimal traffic)

[M,ZZ]=minconnect(varargin)

Erdos-Renyi Random Graph by Pablo Blinder

Random graph generation. (random, graph theory, graphs)

P=permPairs(N)

[G]=erdosRenyi(nv,p,Kreg)

[x,y]=getNodeCoordinates(nv)

Generate Graphs by Jasmine Sandhu

GUI for generating and visualizing graphs. (generating graphs, graph theory, generate)

drawGraph(varargin)

drawRandGraph(Vtx, Edg, direct, VtxLoc, userEdg, addedEdge,...

findGraphProps(Vtx, graph_Edge, direct)

GraphView by Ted Imboden

Displays graphs of three to eight vertices (graph theory, displays, vertices)