Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 7609

Questions about graphs, discrete structures of nodes which are connected by edges. Popular flavors are trees and networks with edge capacity.

3
votes
Per Kleinberg–Tardos, you want to run Bellman–Ford for n iterations and find a cycle in the predecessor array. To find a cycle in the predecessor array, start by coloring every node white. For each n …
answered May 21 '13 by David Eisenstat
17
votes
Probably the easiest way to enumerate all non-isomorphic graphs for small vertex counts is to download them from Brendan McKay's collection. The enumeration algorithm is described in paper of McKay's …
answered Sep 3 '14 by David Eisenstat
5
votes
You can formulate problems like this as an integer program and apply off-the-shelf tools to find (near) optimal solutions. The example is rendered something like this (the exact syntax depends on the …
answered Jan 27 '17 by David Eisenstat
2
votes
I'll present an algorithm by example. Initialize a list of lists containing a list containing all of the players. [[1, 2, 3, 4, 5, 6]] For the first team, TEAM_A, replace each list by two lists, wh …
answered Oct 8 '14 by David Eisenstat