asa_2011_graphs

asa_2011_graphs, an Octave code which was used during labs, demonstrations, and lectures associated with the "Graph Algorithms" portion of the class "Algorithms for Science Applications II", as taught at the Scientific Computing Department, Florida State University, Spring Semester 2011.

The PDF versions of the documents are available as

• asa_2011_graphs.pdf,
  Algorithms for Science Applications:
  Lecture Notes on Graph Algorithms,
  Department of Scientific Computing,
  Florida State University, Spring Semester 2011.
• asa_2011_graphs_homework1.pdf,
  Algorithms for Science Applications:
  Homework #1 on Graph Algorithms,
  Department of Scientific Computing,
  Florida State University, Spring Semester 2011.
• asa_2011_graphs_homework2.pdf,
  Algorithms for Science Applications:
  Homework #2 on Graph Algorithms,
  Department of Scientific Computing,
  Florida State University, Spring Semester 2011.
• asa_2011_graphs_lab.pdf,
  Algorithms for Science Applications:
  Lab on Graph Algorithms,
  Department of Scientific Computing,
  Florida State University, Spring Semester 2011.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

asa_2011_graphs is available in a MATLAB version and an Octave version.

Related Data and Programs:

asa_2011_geometry, an Octave code which was used during labs, demonstrations and lectures for the "Geometry Algorithms" portion of the class "Algorithms for Science Applications II".

asa_2011_images, an Octave code which was used during labs, demonstrations and lectures for the "Image Algorithms" portion of the class "Algorithms for Science Applications II".

dijkstra, an Octave code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

graffiti, a dataset directory which contains 195 abstract graphs, with adjacency and embedding information, stored in the GRF format.

graph_representation, a data directory of examples which representing abstract mathematical graphs in various ways.

graph_representation, an Octave code which expresses the representation of an abstract mathematical graph in several ways.

grf, a data directory which contains examples of GRF files, an abstract graph file format, 2D graphics;

grf_display, an Octave code which reads a GRF file defining a mathematical graph and displays it graphically.

grf_io, an Octave code which reads or writes a GRF file;

subset, an Octave code which enumerates combinations, partitions, subsets, index sets, trees, and other combinatorial objects.

Reference:

1. Edsger Dijkstra,
   A note on two problems in connexion with graphs,
   Numerische Mathematik,
   Volume 1, 1959, pages 269-271.
2. Peter Eades, Ian Fogg, David Kelly,
   SPREMB: A System for Developing Graph Algorithms,
   Congressus Numerantium,
   Volume 66, December 1988.
3. Alan Gibbons,
   Algorithmic Graph Theory,
   Cambridge University Press, 1985,
   ISBN: 0-5212-8881-9,
   LC: QA166.G53.
4. Joseph ORourke,
   Computational Geometry in C,
   Second Edition,
   Cambridge, 1998,
   ISBN: 0521649765,
   LC: QA448.D38.
5. Stephen Skiena,
   Implementing Discrete Mathematics: Combinatorics and Graph Theory in Mathematica,
   Addison Wesley, 1990.
6. Krishnaiyan Thulasiraman, M Swamy,
   Graphs: Theory and Algorithms,
   John Wiley, 1992,
   ISBN: 0471513563,
   LC: QA166.T58.

Source Code:

• dfs_stack.m carries out a depth-first search using a stack.
• dfs_stack_test.m
• next_perm.m, compute the "next" permutation.
• next_perm_test.m
• rand_int.m, return a random integer between 1 and I.
• rand_int2.m, return a random integer between I1 and I2
• rand_perm.m, returns a random permutation of integers 1 to N.
• rand_perm_test.m
• tsp_brute.m, a brute force approach to the Traveling Salesman problem.

• disconnected.grf a GRF description of the "disconnected" graph.
• disconnected.png a PNG image of the "disconnected" graph.
• disconnected_edges.txt the edge list for the disconnected graph.
• disconnected_node_adjs.txt the node-to-node adjacency matrix for the disconnected graph.
• disconnected_node_labels.txt the labels of the nodes for the disconnected graph.
• disconnected_nodes.txt the coordinates of the nodes for the disconnected graph.
• mst.grf, a GRF description of the MST (minimum spanning tree) graph.
• mst.png, a PNG image.
• mst_edge_lengths.txt, the edge lengths;
• mst_edges.txt, the edge list;
• mst_node_adjs.txt, the node-to_node adjacency matrix;
• mst_node_dists.txt, the node-to-node distance matrix;
• mst_node_labels.txt, the node labels;
• mst_nodes.txt, node coordinates.
• museum.grf, a GRF description of the museum graph;
• museum.png, a PNG image of the museum graph.
• museum_adjacency_matrix.txt, the adjacency matrix;
• museum_adjacency_structure.txt, the adjacency structure;
• museum_edges.txt, the edge list;
• museum_incidence_matrix.txt, the incidence matrix;
• museum_node_coordinates.txt, node coordinates.
• museum_node_labels.txt, node labels.
• simple.grf, a GRF file;
• simple.png, a PNG image.
• simple_adjacency_matrix.txt, the adjacency matrix for a simple graph.
• simple_edges.txt, the edge list;
• simple_node_labels.txt, node labels.
• simple_nodes.txt, node coordinates.
• tsp.grf, a GRF file;
• tsp.png, a PNG image.
• tsp_node_adjs.txt, the adjacency matrix;
• tsp_node_dists.txt, the distance matrix;
• tsp_node_labels.txt, node labels.
• tsp_nodes.txt, node coordinates.