Adjacency

This script can be used to create and manipulate adjacency lists in MySQL.It can perform several types of operations to store and retrieve information in a MySQL table of nodes of an adjacency list.Currently it can: add nodes, retrieve the list of all nodes, get the children of a given node,... Platforms: PHP

Computes region adjacency graph of a labeled 2D or 3D image.Two regions are considered as neighbor if they are separated by a background (i. e. with color 0) pixel in the horizontal or vertical direction, as well as depth direction for 3D images.The result is a N*2 array, containing 2 indices for... Platforms: Matlab

Returns a sparse adjacency matrix 'mAdj' according to the incidence matrix 'mInc'. The rows in the incidence matrix must represent the edges, while the columns the vertices.Function can handle directed graphs with incidence matrix containing -1s, indicating an "in-going" edge, and 1s indicating... Platforms: Matlab

Simple GUI for drawing a undirected vertex-edge network/graph. Adjacency matrix for the graph displays in the command line. Platforms: Matlab

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).An independent set of a graph is a subset of vertices in which no two vertices areadjacent. Given a set of vertices, the maximum independent set problem callsfor finding the independent set of maximum... Platforms: Matlab

*Description and Cautions-The SFNG m-file is used to simulate the B-A algorithm and returns scale-free networks of given node sizes. Understanding the B-A algorithm is key to using this code to its fullest. Due to Matlab resource limitations, it may not be possible to generate networks much... Platforms: Matlab

MINimal CONNECTivity (adjacency) matrix for (X,Y) points on a plane, and/or graph of connections. Needs CLINE.Applications: graph theory, optimal traffic, astronomy (e.g. if youwant to see a tree of connected stars selected according to certain bounds on distance and/or magnitude etc).The... Platforms: Matlab

Generates random 2D-paths between start and finish nodes according to densities distribution given by matrix C with leg's contrainsts defined by the adjacency matrix I.P = path_generator(start , finish , I , [C] , [K] , [V] , [delta]);Inputs-------start Index of starting points (r x 1) where... Platforms: Matlab

The Floyd-Warshall algorithm computes the all pairs shortest path matrix for a given adjacency matrix. The algorithm is O(n^3), and in most implementations you will see 3 nested for loops. This is very inefficient in Matlab, so in this version the two inner loops are vectorized (and as a result,... Platforms: Matlab

Return the optimal path given the adjacency/cost sparse matrix and source/destination nodes.Run mexme_dijkstra.m to compile mex-files on your own-plateformRun test_dijkstra.m for the demo Platforms: Matlab

B=largestcomponent(A)This function find the largest connected component of a networks.Input A is the adjacency matrix of the network.Output B is a list of the nodes that are in the largest component.A(B,B) will give the adj. matrix of the largest component. Platforms: Matlab

COMPUTEGTOM computes the generalized overlaping measure algorithm (GTOM) [1]AuthorsJoaquin GodoT-i &IdoT-igo Martincorena University of Navarra -Dpt. of Physics and Applied Mathematics &Centre for Applied Medical Research. Pamplona (Spain). November 22nd, 2007batchComputeGTOM.m contains an... Platforms: Matlab

Given a DAG in adjacency matrix format, this code will determine the topological ordering of the nodes and, using that ordering, efficiently compute the transitive reduction of the DAG. The package furthermore contains code to generate random non-transitive DAGs as well as derived transitive DAGs... Platforms: Matlab

Return the optimal path given the adjacency/cost sparse matrix and source/destination nodes.Run mexme_dijkstra.m to compile mex-files on your own-plateform.Be sure that "mex -setup" have been done at least one.Run test_dijkstra.m for the demo Platforms: Matlab

This function shuffles an adjacency matrix in a way that preserves the structure of the network it represents. It only shuffles the order of the nodes; in other words, if the fourth column swaps places with the fifth column, then the fourth row also swaps places with the fifth row. Every entry on... Platforms: Matlab

k-clique algorithm as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society" - G. Palla, I. DerdoTenyi, I. Farkas, and T. Vicsek - Nature 435, 814d-deOCt818 (2005)[X,Y,Z] = k_clique(k,A)Inputs:k - clique sizeA - adjacency matrixOutputs:X -... Platforms: Matlab

Edit a graph or draw a new one with this GUI.Usage:>> graph_gui;or>> graph_gui(A,xy); Controls:Use the radio buttons to select an action:1. To DRAW a new VERTEX, select 'Draw' and 'Vertex'. Then click inside the axes in the desired location.2. To DELETE a VERTEX, select 'Delete' and 'Vertex'.... Platforms: Matlab

PyMetis is a Python wrapper for the Metis graph partititioning software by Vipin Kumar, George Karypis and others. It includes version 5.0pre2 of Metis and wraps it using the Boost Python wrapper generator library. So far, it only wraps the most basic graph partitioning functionality (which is... Platforms: *nix

SQLAlchemy is the Python SQL toolkit and Object Relational Mapper that gives application developers the full power and flexibility of SQL. It provides a full suite of well known enterprise-level persistence patterns, designed for efficient and high-performing database access, adapted into a... Platforms: Windows, Mac, *nix, Python, BSD Solaris

GNU TeXmacs is a free wysiwyw (what you see is what you want) editing platform with special features for scientists. The software aims to provide a unified and user friendly framework for editing structured documents with different types of content (text, graphics, mathematics, interactive... Platforms: Windows