graph_dist

graph_dist, a MATLAB code which carries out operations on abstract graphs, defined by undirected edges with an associated distance matrix.

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

graph_dist is available in a Fortran90 version and a MATLAB version.

Related Data and Programs:

graph_dist_test

cities, a MATLAB code which handles various problems associated with a set of "cities" on a map.

digraph_adj, a MATLAB code which carries out operations on digraphs, a directed graph. Information is stored in an adjacency matrix. Operations include computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the adjacency matrix, generating fixed and random examples.

floyd, a MATLAB code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.

graph_adj, a MATLAB code which carries out operations on abstract graphs, with undirected edges, represented by an adjacency matrix. Operations include breadth-first search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure.

grf_io, a MATLAB code which reads and writes GRF files.

toms097, a MATLAB code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm.

treepack, a MATLAB code which carries out computations on trees, a simple kind of graph that is minimally connected.

Source Code:

• graph_arc_weight_print.m, prints a weighted graph from an edge list.
• graph_dist_all.m, finds the distance from every node to every other node.
• graph_dist_check.m, checks a distance matrix for consistency.
• graph_dist_min_span_tree.m, computes a spanning tree of minimal length.
• graph_dist_min_span_tree2.m, computes a spanning tree of minimal length.
• graph_dist_min_span_tree3.m, computes a spanning tree of minimal length.
• graph_dist_one.m, computes the distance from one node to all others in a graph.
• graph_dist_pairing_greedy.m, pairs two sets of nodes seeking the least total distance.
• graph_dist_print.m, prints a distance matrix.