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 60116
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
0
votes
1
answer
411
views
In a DAG, longest path where every vertex has degree at most 2
I have a directed acyclic graph (DAG). How I can find the longest path using only vertices with degree at most 2?
Currently, I try this
def all_simple_paths(g):
for path in all_paths(g):
if …
- 109
0
votes
0
answers
256
views
In a DAG, what is the name for a vertex with only one predecessor and one successor?
In a directed acyclic graph (DAG), what is the name for a vertex with only one predecessor and one successor?
- 109