Count Loops in a Graph by Joseph Kirk

Calculates the number of loops in a graph consisting of nodes and edges (graphs, networks, cycles)

Count Loops in a Graph

details()

loops_gui(cmd)

Galerkin Method Dirivative solver (multiple boundary conditions input) by nathanial hapeman

This gui solves second order derivative functions given any possible boundary condition (gui, mathematics, second order differen...)

me_153_final_project_export1(varargin)

Meshing thin shells using four noded elements by Siva Srinivas Kolukula

To mesh thin shells using four noded elements to use in Finite Element Analysis (thin shells, preprocessing, finite element analys...)

MeshConicalShell(Radius,theta,Height,NT,NR)

MeshCylindricalShell(Radius,theta,Height,NH,NT)

MeshSphericalShell(Radius,Height,theta,phi,N)

Meshing a plate using four noded elements by Siva Srinivas Kolukula

To mesh a plate with four noded elements for Finite Element Analysis (preprocessing, mesh, nodes)

MeshCircularPlate(Radius,theta,NR,NT)

MeshRectanglularPlate(L,B,Nx,Ny)

SHOWELEMENTS(ShowElements,ShowNodes,coordinates,X,Y,nel,nod...

Sparse grid quadrature by Greg von Winckel

Computes the nodes and weights for a sparse grid on a hyperrectangle (integration, sparse, quadrature)

[x,w]=spquad(dim,ord,bpt)

solving tsp with ant colony system by ali sg

solving tsp using ant colony system (ant tsp, colony, nodes)

[app]=ants_primaryplacing(m,n);

[at]=ants_cycle(app,m,n,h,t,alpha,beta);

[cost,f]=ants_cost(m,n,d,at,el);

Sequence Diagram tool by Eric Ludlam

Create UML style Sequence Diagrams (diagram, graphs, uml)

sequencediagramdemo

sequenceaddlink(linkname, nodename)

sequencedemo

Dijkstra Algorithm Consistent with Cyclic Paths by Yi Wang

This function and attached examples show finding shortest-paths (including cyclic paths) from a dire (graph, transmat, coding theory)

dijkstra(pathS, pathE, transmat)

dijkstra_stub1.m

dijkstra_stub2.m

Legendre-Gauss Quadrature Weights and Nodes by Greg von Winckel

Computes the Legendre-Gauss weights and nodes for solving definite integrals. (integration, quadrature, legendre)

[x,w]=lgwt(N,a,b)

Legende-Gauss-Lobatto nodes and weights by Greg von Winckel

Computes the Legendre-Gauss-Lobatto weights, nodes and vandermonde matrix. (nodes, lobatto, polynomials)

[x,w,P]=lglnodes(N)

Barycentric Lagrange Interpolating Polynomials and Lebesgue Constant by Greg von Winckel

Computes lagrange interpolating polynomials and Lebesgue function/constant. (approximation, interpolation, barycentric lagrange ...)

L=lebesque(x)

[p]=barylag(data,x)

clockwise.m by Kang Zhao

Judging the direction of a closed curve by provided coordinates of node. (data exploration, direction, clockwise)

n_clock=clockwise(P)

hexavol by Guido Stoeppler

Calculate volume of a hexagon given by 8 coordinates. (hexagon volume, coordinates, nodes)

V=hexavol(xcoords,ycoords,zcoords)