StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POtree maps in JUNG (for a shortest path algorithm)
primarykey
Id
5250896
data
AcceptedAnswerId
5256679
AnswerCount
1
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-03-09T19:10:12.260
FavoriteCount
0
LastActivityDate
2011-03-10T07:37:11.887
LastEditDate
2017-05-23T09:58:31.587
LastEditorUserId
-1
OwnerUserId
45974
ParentId
0
PostTypeId
1
Score
2
ViewCount
1532
LastEditorDisplayName
text
Body
After asking some general advice on shortest path algorithms (<a href="https://stackoverflow.com/questions/5194482/2d-waypoint-pathfinding-combinations-of-wps-to-go-from-curlocation-to-targetloca">2D waypoint pathfinding: combinations of WPs to go from curLocation to targetLocation</a>) and then asking about a more specific implementation (<a href="https://stackoverflow.com/questions/5234557/shortest-path-algorithm-eg-dijkstras-for-500-waypoints-nodes/5234830#5234830">Shortest path algorithm (eg. Dijkstra's) for 500+ waypoints/nodes?</a>) I have decided to use the JUNG library (<a href="http://jung.sf.net/" rel="nofollow noreferrer">http://jung.sf.net/</a>). My goal is now to get the shortest path from point A to point B by using any combination of points from a list of points (size ~1000) where each point is directly connected to all points that are within x distance. For this, I need to setup a tree map. I believe that this is a list of tree map implementations: <a href="http://jung.sourceforge.net/doc/api/edu/uci/ics/jung/graph/class-use/Hypergraph.html#edu.uci.ics.jung.algorithms.shortestpath" rel="nofollow noreferrer">http://jung.sourceforge.net/doc/api/edu/uci/ics/jung/graph/class-use/Hypergraph.html#edu.uci.ics.jung.algorithms.shortestpath</a> Is that correct? Now, all these implementations limit themselves to sparse tree maps, yet I have to create a rather dense tree map. So, what tree map should I use in JUNG to accomplish my goal?
Tags
<java><path-finding><shortest-path><graph-algorithm><jung>
Title
tree maps in JUNG (for a shortest path algorithm)
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USCommunity
UserOwnerUserId
1. USTom
plurals
PostLinksPostIdRelatedPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
2. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POtree maps in JUNG (for a shortest path algorithm)
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POtree maps in JUNG (for a shortest path algorithm)
 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.