StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
19991908
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-11-15T01:33:34.613
FavoriteCount
0
LastActivityDate
2013-11-15T01:33:34.613
LastEditDate
LastEditorUserId
0
OwnerUserId
1275859
ParentId
19968235
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
<p>Well most of the algorithms, at least the ones I found, implementing BFS or DFS will output the nodes they visit - for instance when a dead-end is visited, upon backtracking, the deadend node is also is truly shown in the path. The main issue is to create a queue data structure in matlab; I couldnt find any useful available Queue implementations, so I used structures (I am sure it's not a very efficient way but I need to store data in matlab in the following format, for instance:</p> <pre><code>[['1', '4', '8'], ['1', '2', '5', '9'], ['1', '2', '5', '10'], ['1', '4', '7', '11']] the Pseudo code is: function [nodes,links] = bfs4(GRAPH, start, destination)% def BFS(graph,start,end,q): nodes=struct; links=struct; path = struct; temp_path = start; last_node=[]; % q.enqueue(temp_path) path(1).data = temp_path; while size(fieldnames(path),1)~=0 tmp_path = path(1).data; if length(path) == 1 path=struct; else path = path(2:end); end last_node = tmp_path(end); % Storing the nodes in Two Forms (NODEs) and (LINKs) if last_node == destination tmp_path; if size(fieldnames(nodes),1)==0 nodes(end).data=tmp_path else nodes(end+1).data=tmp_path end % taking the links link=[]; for i=1:(length(tmp_path)-1) link(i) = GRAPH(GRAPH(:,2)==tmp_path(i) & GRAPH(:,3)==tmp_path(i+1)); end if size(fieldnames(links),1)==0 links(end).data=link; else links(end+1).data=link; end end [row] = find(GRAPH(:,2)==last_node); for i=1:size(row,1) % be careful -- the condition to be remove GRAPH(row(i),10)>0 if GRAPH(row(i),10)>0 && ismember(GRAPH(row(i),3),tmp_path)==0 new_path=[]; new_path = [tmp_path GRAPH(row(i),3)]; if size(fieldnames(path),1)==0 path(end).data = new_path; else path(end+1).data = new_path; end end end end % while end % function </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POall possible paths between two nodes in a matlab matrix
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USRamin
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.