Search Results
| 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 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| 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 graphs
Search options not deleted
user 14755
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
2
votes
Accepted
Decomposing a closed walk in a directed graph into cycles
The problem stated in the question is also presented in the exercise of the book.
If you are writing a research paper, due to the is simplicity of the solution, you may even skip the explanation.
- 246
2
votes
Algorithm: Finding shortest path through a dungeon in a game
In addition to the above answer, I would point out some TSP solvers already available.
Concorde TSP Solver
TSP solver provided by Stony Brooks University
TSP solver using Google Direction API
And Ma …
- 246