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 81517
A graph is an abstract representation of objects (vertices) connected by links (edges). For questions about plotting data graphically, use the [data-visualization] tag instead.
12
votes
3
answers
460
views
Kosaraju in Scala
Here's a terribly slow implementation of Kosaraju algorithm to find strongly connected components in a graph. … The first number is a vertex, the second a directed connection in the graph:
1 2
2 3
3 1
3 4
5 4
6 4
8 6
6 7
7 8
Original implementation:
import scala.io.Source …
- 161
1
vote
Kosaraju in Scala
Updated implementation with Donald's feedbacks. The code is made more readable by putting the file parsing and adjacency list build in dedicated methods.
import scala.io.Source …