StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POWhat kind of data structure is most efficient for a DAG given no node class?
primarykey
Id
8306898
data
AcceptedAnswerId
8307061
AnswerCount
2
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-11-29T06:45:00.547
FavoriteCount
0
LastActivityDate
2011-11-29T07:30:05.360
LastEditDate
LastEditorUserId
0
OwnerUserId
765647
ParentId
0
PostTypeId
1
Score
3
ViewCount
1175
LastEditorDisplayName
text
Body
<p>I have a directed acyclic graph I'm trying to implement but I'm not sure what structure I can use. I keep believing that a tree or adjacency list would be viable but I am not given nodes to work with.</p> <p>So in this case I tried to implement it using a 2d array, storing the priorities, in degrees and out degrees. However, I'm having problems figuring out how to insert an edge between two vertices and how I can check if a vertice is another vertice's parent in this way.</p>
Tags
<c++><algorithm>
Title
What kind of data structure is most efficient for a DAG given no node class?
singulars
PostAcceptedAnswerId
1. PO
  singulars
  PostTypePostTypeId
  PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USrcell
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. PO
  singulars
  PostTypePostTypeId
  PTAnswer
2. PO
  singulars
  PostTypePostTypeId
  PTAnswer
VotesPostIdCreationDate
1. VO
  singulars
  PostPostId
  POWhat kind of data structure is most efficient for a DAG given no node class?
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
2. VO
  singulars
  PostPostId
  POWhat kind of data structure is most efficient for a DAG given no node class?
  UserUserId
  This table or related slice is empty.
  VoteTypeVoteTypeId
  VTUpMod
3. VO
  singulars
  PostPostId
  POWhat kind of data structure is most efficient for a DAG given no node class?
  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.