IAPPGA
Program Package for Graph Algorithms

Dr. Mingshen Wu
Department of Math, Stat, & Computer Science

You may input your graph by drawing the graph online or by providing the adjacency matrix of your graph. In fact, for graphs of larger size, better use adjacency matrix (you may copy/paste the matrix into the proper box); for small graphs, it is fun to draw it online. Drawing allows up to 25 vertices.

I split the graphs with or without weights into different categories just for fast drawing when another feature is not needed.

Undirected Graphs:

• Provide a Simple/Weighted Graph Using the Adjacency Matrix

  Including: Moore's distance algorithm; Dijkstra's Shortest Path algorithm; Kruskal's MST algorithm; Prim's MST algorithm; BFS visiting algorithm; DFS visiting algorithm.

• Provide a Simple Graph by Drawing the Graph Online

  Including: ; Moore's Distance algorithm; BFS visiting algorithm; DFS visiting algorithm.

• Provide a Weighted Graph by Drawing the Graph Online

  Including: Dijakstra's Shortest Path apgorithm; Kruskal's MST algorithm; Prim's MST algorithm; BFS visiting algorithm; DFS visiting algorithm.

• Provide a Directed/weighted Graph Using the Adjacency Matrix

  Including: Max Flow and Min Cut algorithm; BFS visiting in a digraph; Dijkstra's Shortest Directed Path algorithm; Finding a Directed Cycle.

• Provide a Directed Graph without weights by Drawing Online

  Including: Dijkstra's Shortest Directed Path algorithm; BFS visiting in a digraph; DFS visiting in a digraph. Finding a Directed Cycle.

• Provide a Directed and Weighted Graph by Drawing Online

  Including: Dijkstra's Shortest Directed Path algorithm; Finding a Directed Cycle; Max Flow and Min Cut algorithm; BFS visiting in a digraph; DFS visiting in a digraph;

Additional Program:

• Checking whether an integer sequence is graphical