From 78d68c1490ff3c66e51a326088c4972c6675cc7a Mon Sep 17 00:00:00 2001 From: Jesse Luehrs Date: Fri, 26 Jun 2009 20:57:21 -0500 Subject: typo --- lib/Graph/Implicit.pm | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'lib') 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. -- cgit v1.2.3-54-g00ecf