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 42371
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
3
votes
Accepted
Basic questions about network flow calculations
I think all your questions are answered by examining the actual algorithm to compute the max flow.
With regards to your Q1: in the max flow problem your input is a graph and capacities on edges, your …
- 1,503
2
votes
How many $(x, y)$-paths of length $20$ are there, where $x$, $y$ adjacent vertices in cycle ...
Hint: consider powers of adjacency matrix of $C_5$ (Wiki: Matrix powers).
- 1,503
13
votes
Accepted
Linear-time algorithm to find an odd-length cycle in a directed graph
Let $G$ be strongly connected. Run BFS (!) from an arbitrary vertex $s$. BFS creates a leveled tree where level of a vertex $v$ is it's directed distance from $s$. If while running BFS you have never …
- 1,503