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 answers only user 22863

Questions on Hamiltonian paths, that is, paths that visit each vertex exactly once in a graph.

2
votes
Graphviz should do what you want. http://www.graphviz.org/ You can you use it as program or as a library. If you use as a program, then you just need to write a file of your graphs in the dot langu …
answered Apr 12 '15 by Rafael Castro