StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POLinked list with multiple parent and child nodes
primarykey
Id
18140460
data
AcceptedAnswerId
18277182
AnswerCount
6
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2013-08-09T05:21:47.213
FavoriteCount
2
LastActivityDate
2014-01-06T23:36:26.407
LastEditDate
2013-08-16T06:02:14.017
LastEditorUserId
2016977
OwnerUserId
2016977
ParentId
0
PostTypeId
1
Score
4
ViewCount
5670
LastEditorDisplayName
text
Body
I am trying to design a program that takes in data from a file, after which it gives numbering to unique data, linked list also contains parent and child lists. Data structure: <pre><code> ____A / | B C | / \ E--> F G | | | I J K </code></pre> The nodes can have more than one next nodes (e.g. A and C), and can have more than one previous nodes. The text file contains the data like this, i'll get the data from file and turn them into linked list: <pre><code> A B E I A C E F J A C G K </code></pre> My Question: Is it possible to create linked list with nodes with more than one next or more than one previous nodes, if so how would the struct look like? What i have tried: I made a struct which contains an array of 4 integers for parent and child. <pre><code>struct abcd{ char data; int nodeid; int parent[4]; int child[4]; struct abcd *next; } </code></pre> So the parent array holds node-id of most previous node (can be more than one since e.g. E (B & C are pointing to it) --> (node-id - 1). Child array holds node-id of instant next node (node-id +1). There are no duplicate nodes for A or any other. OUTPUT: <pre><code>1 : A <-- 2 : B <-- 1 3 E <-- 2,5 4 : I <-- 3 5 : C <-- 1 6 : F <-- 3 7 : J <-- 6 8 : G <-- 5 9 : K <-- 8 </code></pre> Hopefully its clear, please let me no how i should go about implementing it. Regards.
Tags
<c><linked-list><doubly-linked-list>
Title
Linked list with multiple parent and child nodes
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USDeepak Tivari
UserOwnerUserId
1. USDeepak Tivari
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
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
CommentsPostId
1. COyou should call it graph
 singulars
 PostPostId
 POLinked list with multiple parent and child nodes
 UserUserId
 USGrijesh Chauhan
2. COYou haven't actually said whether your system could have cycles A->D->A. If not this is a Directed Acyclic Graph, which is important because there's lots of research on DAG's. Generally graphs that are garanteed to be acyclic are easier to navigate safely (no history/loop detection required).
 singulars
 PostPostId
 POLinked list with multiple parent and child nodes
 UserUserId
 USSpeed8ump

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.