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 47896
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
3
votes
1
answer
94
views
A Question about a Question related to Graph Theory and Maximum Flow
The following question is from the book "Introduction to Algorithms" By Cormen and three other authors.
$26.2-10$
Show how to find a maximum flow in a network $G = (V,E)$ by a sequence of at
most $|E …
- 369
0
votes
1
answer
528
views
Dijkstra's Algorithm
I have recently implemented Dijkstra's Algorithm to the shortest path between all pairs of nodes in the graph. I have implemented this code in Java. As instructed I am using a linked list to represent …
- 369
3
votes
1
answer
944
views
The Number of Paths in a Directed Graph
Is it true for the special case of directed acyclic graphs?
Bob …
- 369