//************************************** // tolman2graphs.sci // // Different Graph Models // Used within the experiments // //************************************** // Authors: G.Doeben-Henisch // // First: Dec-17, 2012 // Last: Dec-17, 2012, 23:15h //****************************************** // Idea // We assume here directed graphs as models for possible paths in mazes // We are interested in the probabilities within such graphs with regard to certain properties // One important property is the probability to find the shortest path to a goal in the maze = vertex in the graph //******************************************** // A directed graph is assumed to be a set of vertices V with directed edges E between the vertices. // An edge can have a weight w in W. //******************************************* // Example graph T2F1 // Taken from Tolmans maze TOLMAN2 with the partial goal F1 // TOLMAN2=['T2F12'; 'T2F13';'T2F14';'T2F15';'T2F26';'T2F27';'T2F28';'T2F29';'T2F210'] T2F12=[ 0 1; 1 0] T2F13=[ 0 1 0; 1 0 1; 0 1 0; ] T2F14=[ 0 1 0 0; 1 0 1 0; 0 1 0 1; 0 0 1 0 ] T2F15=[ 0 1 0 0 0; 1 0 1 0 0; 0 1 0 1 0; 0 0 1 0 1; 0 0 0 1 0 ] T2F26=[ 0 1 0 0 0 0; 1 0 1 0 0 0; 0 1 0 1 0 0; 0 0 1 0 1 1; 0 0 0 1 0 1; 0 0 0 1 1 0 ] T2F27=[ 0 1 0 0 0 0 0; 1 0 1 0 0 0 0; 0 1 0 1 0 0 0; 0 0 1 0 1 1 0; 0 0 0 1 0 1 0; 0 0 0 1 1 0 1; 0 0 0 0 0 1 0 ] T2F28=[ 0 1 0 0 0 0 0 0; 1 0 1 0 0 0 0 0; 0 1 0 1 0 0 0 0; 0 0 1 0 1 1 0 0; 0 0 0 1 0 1 0 0; 0 0 0 1 1 0 1 0; 0 0 0 0 0 1 0 1; 0 0 0 0 0 0 1 0 ] T2F29=[ 0 1 0 0 0 0 0 0 0; 1 0 1 0 0 0 0 0 0; 0 1 0 1 0 0 0 0 0; 0 0 1 0 1 1 0 0 0; 0 0 0 1 0 1 0 0 0; 0 0 0 1 1 0 1 0 0; 0 0 0 0 0 1 0 1 0; 0 0 0 0 0 0 1 0 1; 0 0 0 0 0 0 0 1 0 ] T2F210=[ 0 1 0 0 0 0 0 0 0 0; 1 0 1 0 0 0 0 0 0 0; 0 1 0 1 0 0 0 0 0 0; 0 0 1 0 1 1 0 0 0 0; 0 0 0 1 0 1 0 0 0 0; 0 0 0 1 1 0 1 0 0 0; 0 0 0 0 0 1 0 1 0 0; 0 0 0 0 0 0 1 0 1 0; 0 0 0 0 0 0 0 1 0 1; 0 0 0 0 0 0 0 0 1 0 ]