out package:fgl

out :: Graph gr => gr a b -> Node -> [LEdge b]
fgl Data.Graph.Inductive.Graph
Find all outward-bound LEdges for the given Node.
out' :: Context a b -> [LEdge b]
fgl Data.Graph.Inductive.Graph
All outward-directed LEdges in a Context.
outdeg :: Graph gr => gr a b -> Node -> Int
fgl Data.Graph.Inductive.Graph
The outward-bound degree of the Node.
outdeg' :: Context a b -> Int
fgl Data.Graph.Inductive.Graph
The outward degree of a Context.
gvdOut :: (Graph gr, Real b) => [Node] -> gr a b -> Voronoi b
fgl Data.Graph.Inductive.Query.GVD
Produce a shortest path forest (the roots of which are those nodes specified) from nodes in the graph from one of the root nodes (if possible).