image thumbnail

updated 6 months ago

shortest_distance_Dijkstra_algorithm.m by Alok Patel

Finds Shortest Distance between nodes using Dijkstra Algorithm. (shortest distance, distance algorithm, dijkstra algorithm)

shortestdistalgo(Weight_matrix,startterminal_matrix,endte...

image thumbnail

updated 2 years ago

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)

image thumbnail

updated 2 years ago

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)

image thumbnail

updated almost 3 years ago

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)

image thumbnail

updated almost 3 years ago

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,n...

image thumbnail

updated 6 years ago

Sparse grid quadrature by Greg von Winckel

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

image thumbnail

updated 7 years ago

solving tsp with ant colony system by ali sg

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

[app]=ants_primaryplacing(m,n);

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

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

image thumbnail

updated 8 years ago

Sequence Diagram tool by Eric Ludlam

Create UML style Sequence Diagrams (specialized, plotting, sequence)

sequencediagramdemo

createnode(nodename, linkidx, loop)

makelink(linkname, linkidx, lastnodeidx, nodeidx)

image thumbnail

updated 9 years ago

Dijkstra Algorithm Consistent with Cyclic Paths by Yi Wang

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

dijkstra(pathS, pathE, transmat)

dijkstra_stub1.m

dijkstra_stub2.m

image thumbnail

updated 10 years ago

Legendre-Gauss Quadrature Weights and Nodes by Greg von Winckel

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

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

image thumbnail

updated 10 years ago

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

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

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

image thumbnail

updated 10 years ago

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)

image thumbnail

updated 11 years ago

clockwise.m by Kang Zhao

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

image thumbnail

updated almost 12 years ago

hexavol by Guido Stoeppler

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

Contact us