Undirected

Connected component analysis on undirected graphs, with thresholding and connectivity constraints. Tristan Ursell, (c) 2012Connected component analysis on an undirected graph, with variousthresholding and connectivity constraints.[groups,orphans] = graph_analysis(W);[groups,orphans] =... Platforms: Matlab

Bio::ConnectDots::SimpleGraph is a simple, hopefully fast undirected graph package. SYNOPSIS use SimpleGraph; my $graph=new Bio::ConnectDots::SimpleGraph; # read pairs of nodes from STDIN while (<>) { my($node1,$node2)=split; $graph->add_edge($node1,$node2); } my @nodes=graph->nodes;... Platforms: *nix

This script takes as input a graph and outputs Eulerian path (if such exists). The worst running time is O(E^2). Platforms: Windows, Mac, *nix, Python, BSD Solaris

Counts all cycles in input graph up to (optional) specified size limit, using a backtracking algorithm. Designed for undirected graphs with no self-loops or multiple edges. Returns count of each size cycle from 3 up to size limit, and elapsed time.Algorithm is guaranteed to find each cycle... Platforms: Matlab

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

This is a simple tool for generating and visualizing graphs (directed, undirected and undirected random graphs). It is still a working copy -- so please bear with me as I fix bugs. Platforms: Matlab

Bio::Graph::SimpleGraph is a Perl module that can create and manipulate undirected graphs. SYNOPSIS use Bio::Graph::SimpleGraph; my $graph=new SimpleGraph; # read pairs of nodes from STDIN while (<>) { my($node1,$node2)=split; $graph->add_edge($node1,$node2); } my @nodes=graph->nodes;... Platforms: *nix

The QuickGraph package will provide generic directed / undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common... Platforms: Windows

*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

This function can 1. Find the shortest path and distance from a starting node to an ending node on a map** 2. Find the shortest paths and distances from a starting node to ALL other nodes on a map****The map should consist of nodes and segments, such that: 1. nodes have the format [ID X Y] or [ID... Platforms: Matlab

CSMV calculates distances from a given set of points to a set of linear segments SYNOPSIS: [squared_distances_to_segments I]=csmv(P,R,Q,to_plot) [squared_distances_to_segments I]=csmv(P,R,Q,...) INPUT P,R : arrays of coordinates of 2n segment endpoints (i.e., if there are n segments considered in... Platforms: Matlab

the function:A = createRandRegGraph(vertNum, deg)create a simple d-regular undirected graphvertNum - number of vertices.deg - the degree of each vertex.A is asparse matrix representation of the graph.reference for "The pairing model":http://citeseerx.ist.psu.edu/viewdoc/downl...p=rep1&type=pdf Platforms: Matlab

This function has been designed to implement APAC algorithm proposed by Ricardo SimdoTAes in his research contribution in Revista de Estudos PolitdoTecnicos, Polytechnical Studies Review, 2009, Vol VII, ndlDo12, 039-055. This code has been modified from the algorithm so as to get all paths... Platforms: Matlab

igraph is a free software package for creating and manipulating undirected and directed graphs. It includes implementations for classic graph theory problems like minimum spanning trees and network flow, and also implements algorithms for some recent network analysis methods, like community... Platforms: *nix

Graph::ModularDecomposition is a Perl module for modular decomposition of directed graphs. SYNOPSIS use Graph::ModularDecomposition qw(pairstring_to_graph tree_to_string); my $g = new Graph::ModularDecomposition; my $h = $g->pairstring_to_graph( ab,ac,bc ); print "yesn" if... Platforms: *nix

Algorithm::SocialNetwork is a social network analysis. SYNOPSIS use Graph::Undirected; use Algorithm::SocialNetwork; my $G = Graph::Undirected->new(); $G->add_edges([qw(a b)], [qw(b c)]); my $algo = Algorithm::SocialNetwork->new(graph => $G3); my $BC = $algo->BetweenessCentrality(); #... Platforms: *nix

GraphViz is a Perl interface to the GraphViz graphing tool. SYNOPSIS use GraphViz; my $g = GraphViz->new(); $g->add_node(London); $g->add_node(Paris, label => City ofnlurve); $g->add_node(New York); $g->add_edge(London => Paris); $g->add_edge(London => New York, label => Far);... Platforms: *nix

txt2graph should visualize the structure and dependencies of a text. It reads a text document from stdin, removes all non-alphas and generates an array (list) of words. Then it converts german-umlauts, because graphviz can only handle clean ASCII as node-description and output a dot-file for a... Platforms: *nix, Perl, BSD

In the mathematical field of graph theory, a spanning tree of a connected, undirected graph is a tree which includes every vertex of that graph. More generally, a spanning forest of an arbitrary undirected graph is a forest which includes every vertex of the graph. Spanning forests always exist,... 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