IMPS_2017/FILES/11_30

• 11_30.pdf, Lecture notes (PDF);
• 11_30.ppt, Lecture notes (PowerPoint);
• a_reaches_b.m, a program which returns TRUE if there is a path from node A to node B.
• adj2.m, the adjacency matrix for the second example.
• a_to_b.m, returns TRUE if there is a path from node A to node B.
• a_to_b_path.m, returns a path from node A to node B.
• disconnected_adj.m, the adjacency matrix for a disconnected graph.
• euler_adj.m, the adjacency matrix for the Euler bridge problem.
• fleury_adj.m, the adjacency matrix for the Fleury example.
• graph_connected.m, returns TRUE if a graph is connected.
• risk_adj.m, the adjacency matrix for the RISK game board.
• risk_adj_spy.jpg, a plot of the RISK adjacency matrix produced by the spy() command.