diff options
| author | Jesse Luehrs <doy@tozt.net> | 2009-06-26 20:57:21 -0500 |
|---|---|---|
| committer | Jesse Luehrs <doy@tozt.net> | 2009-06-26 20:57:21 -0500 |
| commit | 78d68c1490ff3c66e51a326088c4972c6675cc7a (patch) | |
| tree | 224932d0936e4a17fa7965155fbe9ff14e3a7186 | |
| parent | ec263aa3e410d090b7c31052d3809a240a23943d (diff) | |
| download | graph-implicit-78d68c1490ff3c66e51a326088c4972c6675cc7a.tar.gz graph-implicit-78d68c1490ff3c66e51a326088c4972c6675cc7a.zip | |
typo
| -rw-r--r-- | lib/Graph/Implicit.pm | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/Graph/Implicit.pm b/lib/Graph/Implicit.pm index 3c1843f..0de834a 100644 --- a/lib/Graph/Implicit.pm +++ b/lib/Graph/Implicit.pm @@ -41,7 +41,7 @@ all, each method that is called on one needs a vertex to start traversing the graph from, and any vertices not reachable from that vertex won't be found. A few algorithms are also not able to be implemented as efficiently as possible, since the entire graph isn't known ahead of time; for instance, finding all the -edges of the graph requires actually doing a grpah traversal, rather than just +edges of the graph requires actually doing a graph traversal, rather than just reading them out of the data structure, like you would do in an explicit graph representation. |