StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4385001
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-12-08T07:09:31.537
FavoriteCount
0
LastActivityDate
2011-12-22T00:03:22.753
LastEditDate
2011-12-22T00:03:22.753
LastEditorUserId
179104
OwnerUserId
0
ParentId
1072964
PostTypeId
2
Score
23
ViewCount
0
LastEditorDisplayName
text
Body
<p>the well knowns are :</p> <ul> <li>Depth-first search <a href="http://en.wikipedia.org/wiki/Depth-first_search" rel="noreferrer">http://en.wikipedia.org/wiki/Depth-first_search</a></li> <li>Breadth-first search <a href="http://en.wikipedia.org/wiki/Breadth-first_search" rel="noreferrer">http://en.wikipedia.org/wiki/Breadth-first_search</a></li> <li>Prim's algorithm <a href="http://en.wikipedia.org/wiki/Prim%27s_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Prim's_algorithm</a></li> <li>Kruskal's algorithm <a href="http://en.wikipedia.org/wiki/Kruskal%27s_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Kruskal's_algorithm</a></li> <li>Bellman–Ford algorithm <a href="http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm</a></li> <li>Floyd–Warshall algorithm <a href="http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm</a></li> <li>Reverse-delete algorithm <a href="http://en.wikipedia.org/wiki/Reverse-Delete_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Reverse-Delete_algorithm</a></li> <li>Dijkstra's_algorithm <a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Dijkstra's_algorithm</a> </li> </ul> <p>network flow</p> <ul> <li>Ford–Fulkerson algorithm <a href="http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm" rel="noreferrer">http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm</a></li> <li>Maximum Flow <a href="http://en.wikipedia.org/wiki/Maximum_flow_problem" rel="noreferrer">http://en.wikipedia.org/wiki/Maximum_flow_problem</a></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PONames of Graph Traversal Algorithms
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USraveren
UserOwnerUserId
1. This table or related slice is empty.
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. PONames of Graph Traversal Algorithms
  singulars
  PostTypePostTypeId
  PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
2. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
3. VO
  singulars
  PostPostId
  PO
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
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.