| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
IntLike.Graph
Documentation
newtype IntLikeGraph x Source #
Constructors
| IntLikeGraph | |
Fields | |
Instances
adjacencyIntMultiMap :: IntLikeGraph x -> IntLikeMultiMap x x Source #
vertexList :: Coercible x Int => IntLikeGraph x -> [x] Source #
fromDirectedEdges :: Coercible x Int => [(x, x)] -> IntLikeGraph x Source #
fromUndirectedEdges :: Coercible x Int => [(x, x)] -> IntLikeGraph x Source #
Constructors
| Component | |
Fields
| |
Instances
| Enum Component Source # | |
Defined in IntLike.Graph Methods succ :: Component -> Component # pred :: Component -> Component # fromEnum :: Component -> Int # enumFrom :: Component -> [Component] # enumFromThen :: Component -> Component -> [Component] # enumFromTo :: Component -> Component -> [Component] # enumFromThenTo :: Component -> Component -> Component -> [Component] # | |
| Show Component Source # | |
| NFData Component Source # | |
Defined in IntLike.Graph | |
| Eq Component Source # | |
| Ord Component Source # | |
| Hashable Component Source # | |
Defined in IntLike.Graph | |
undirectedComponents :: Coercible x Int => [(x, x)] -> IntLikeEquiv Component x Source #