StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8265880
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2011-11-25T07:23:59.133
FavoriteCount
0
LastActivityDate
2011-11-25T07:36:50.130
LastEditDate
2011-11-25T07:36:50.130
LastEditorUserId
626318
OwnerUserId
626318
ParentId
8265307
PostTypeId
2
Score
2
ViewCount
0
LastEditorDisplayName
text
Body
Use a <a href="http://docs.oracle.com/javase/7/docs/api/java/util/Scanner.html" rel="nofollow">Scanner</a> to parse the file data. For each tuple, if the source vertex hasn't been created, create it, otherwise find it in the pre-existing graph -- create a search function. Do the same for the target vertex. Next, create an edge with a weight equal to the third token in the tuple, and add the target vertex to the edge. Finally, add the edge to the adjacency list of the source vertex. For the previously mentioned search function, you can implement something that can search through each vertex of the graph starting from any vertex. Recursion will be necessary. <pre><code>public static Vertex search(Vertex src, String name); </code></pre> A simpler solution is to keep a list of all the vertices you create as your constructing the graph and search through that. <pre><code>public static Vertex search(List<Vertex> vertices, String name); </code></pre> When your done constructing the graph and you have the name of the vertex where Dijkstra's algorithm will begin, you can use the search function to get a reference to the vertex. <pre><code>Dijkstra.computePath(search(vertices, startVertexName)); </code></pre> And, that's it. Here's an example of how to parse your file data: <pre><code>List<Vertex> vertices = new ArrayList<Vertex>(); String src = "Pittsburgh Philadelphia 323 "+ "Pittsburgh Ohio 125 "+ "Ohio Philadelphia 400 "+ "-1 Ohio"; //new Scanner(new File(fileName)); Scanner scnr = new Scanner(src); String src, target; int weight; while(scnr.hasNext()) { src = scnr.next(); if(src.equals("-1")) break; else { target = scnr.next(); weight = scnr.nextInt(); } //call search(), implement logic in addToGraph() addVertexToGraph(src, target, weight, vertices); } String startVertexName = scnr.next(); scnr.close(); </code></pre> Note that <a href="http://docs.oracle.com/javase/7/docs/api/java/util/Scanner.html#next%28%29" rel="nofollow">Scanner.next</a> returns the next token separated by white space (the default delimiter), so your file data must be formatted that way.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POFile input for Dijkstra's algorithm
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USblackcompe
UserOwnerUserId
1. USblackcompe
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. 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
CommentsPostId
1. CO+1 nice answer.
 singulars
 PostPostId
 PO
 UserUserId
 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.