StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8798604
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2012-01-10T04:34:23.073
FavoriteCount
0
LastActivityDate
2012-01-10T04:34:23.073
LastEditDate
LastEditorUserId
0
OwnerUserId
632088
ParentId
8798528
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
If you're getting intertested in this sort of thing, i recommend you try out some of the problems on project euler, e.g. <a href="http://projecteuler.net/problem=15" rel="nofollow">http://projecteuler.net/problem=15</a> In pythons itertools module it has some examples with example code. You could convert the sample code to the programming language of your choice. <a href="http://docs.python.org/library/itertools.html" rel="nofollow">http://docs.python.org/library/itertools.html</a> sample functions: <pre><code>product('ABCD', repeat=2) AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD permutations('ABCD', 2) AB AC AD BA BC BD CA CB CD DA DB DC combinations('ABCD', 2) AB AC AD BC BD CD combinations_with_replacement('ABCD', 2) AA AB AC AD BB BC BD CC CD DD </code></pre> sample code: <pre><code>def combinations(iterable, r): # combinations('ABCD', 2) --> AB AC AD BC BD CD # combinations(range(4), 3) --> 012 013 023 123 pool = tuple(iterable) n = len(pool) if r > n: return indices = range(r) yield tuple(pool[i] for i in indices) while True: for i in reversed(range(r)): if indices[i] != i + n - r: break else: return indices[i] += 1 for j in range(i+1, r): indices[j] = indices[j-1] + 1 yield tuple(pool[i] for i in indices) </code></pre> Note that in your above problem, if you are allowing one to go from point x1,y1 to point x2,y2 in straight line distance, then it isn't the same problem. (as you can sort the points and put them into a spatial datastructure). I Think in the traveling salesman problem, you're supposed to have "windy/hilly roads" so that even if two points are close together in terms of x and y, they may have a large weighted edge connecting them.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POcombinatorics for programmers?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USrobert king
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
CommentsPostId
1. COI tried writing a few phython programs using this but this does not do what I am trying to do.
 singulars
 PostPostId
 PO
 UserUserId
 USuser802599
2. COah bad luck. keep practicing. Try the first few project euler problems and look at the python solutions in the forum after to see how your code compares.
 singulars
 PostPostId
 PO
 UserUserId
 USrobert king

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.