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 graph
Search options not deleted
user 98803
a mathematical structure that contains a collection of vertices or 'nodes' and a collection of edges that connect pairs of vertices
6
votes
How to represent a graph with multiple edges allowed between nodes and edges that can select...
Assuming space is not a concern, would it be reasonable to create multiple copies of the graph (one for each user) rather than a single graph? … of your graph library). …
- 2,045
5
votes
1
answer
307
views
What is the maximum number of steps to find a bug using bisecting?
tree [B,A] leading from B to A, can we predict c the maximum number of steps needed to locate the commit where the bug appeared, in terms of number of vertices, arrows, merges or cycles and other simple graph …
- 2,045
3
votes
Accepted
Are there multiple Hamiltonian Paths on a Graph?
We want to generate all pinned hamiltonian paths connecting two nodes a and b in a given graph. … module Graph =
struct
type t = {
node: int list;
edge: (int * int list) list;
}
let nodes graph =
List.sort_uniq Pervasives.compare graph.node
let neighbours graph n =
try List.assoc …
- 2,045
1
vote
Accepted
How to canonise a road network
I had to perform the treatment you describe on the road network of German city (about 200.000 inhabitants). I devised a procedure that produced great results: the road network has over 2000 road por …
- 2,045