IMPS_2017/FILES/12_05

• 12_05.pdf, Lecture notes (PDF);
• 12_05.ppt, Lecture notes (PowerPoint);
• a_to_b.m, is there a path from A to B?;
• a_to_b_path.m, what is the path from A to B?;
• bfs.m, breadth-first search of a graph;
• dfs.m, depth-first search of a graph;
• disconnected_adj.m, adjacency matrix for disconnected graph;
• disconnected_label.m, labels for disconnected graph;
• distance_from.m, distance from a node to all nodes.
• graph_connected.m, is a graph connected?;
• make-maze.m, makes a maze;
• maze.m, makes a maze;
• museum_adj.m, adjacency matrix for museum;
• museum_label.m, labels for museum graph;
• risk_adj.m, adjacency for RISK game;
• risk_label.m, labels for RISK game.
• tremaux_adj.m, adjacency for Tremaux example.
• tremaux_label.m, labels for Tremaux example.