Commit d3cca30d authored by Kai Zhang's avatar Kai Zhang

fix haddock problems

parent 07e586ad
Copyright (c) 2015 Kai Zhang Copyright (c) 2016 Kai Zhang
Permission is hereby granted, free of charge, to any person obtaining Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the a copy of this software and associated documentation files (the
......
...@@ -16,25 +16,25 @@ import IGraph.Internal.Clique ...@@ -16,25 +16,25 @@ import IGraph.Internal.Clique
import IGraph.Internal.Data import IGraph.Internal.Data
import IGraph.Internal.Layout import IGraph.Internal.Layout
data LayoutMethod = KamadaKawai data LayoutMethod =
{ kk_seed :: !(Maybe [(Double, Double)]) KamadaKawai { kk_seed :: !(Maybe [(Double, Double)])
, kk_nIter :: !Int , kk_nIter :: !Int
, kk_sigma :: (Int -> Double) -- ^ The base standard deviation of position , kk_sigma :: (Int -> Double) -- ^ The base standard deviation of
-- change proposals -- position change proposals
, kk_startTemp :: !Double -- ^ The initial temperature for the annealing , kk_startTemp :: !Double -- ^ The initial temperature for the annealing
, kk_coolFact :: !Double -- ^ The cooling factor for the simulated annealing , kk_coolFact :: !Double -- ^ The cooling factor for the simulated annealing
, kk_const :: (Int -> Double) -- ^ The Kamada-Kawai vertex attraction constant , kk_const :: (Int -> Double) -- ^ The Kamada-Kawai vertex attraction constant
} }
| LGL -- ^ the Large Graph Layout algorithm | LGL { lgl_nIter :: !Int
{ lgl_nIter :: !Int , lgl_maxdelta :: (Int -> Double) -- ^ The maximum length of the move allowed
, lgl_maxdelta :: (Int -> Double) -- ^ The maximum length of the move allowed for -- for a vertex in a single iteration. A reasonable default is the number of vertices.
-- a vertex in a single iteration. , lgl_area :: (Int -> Double) -- ^ This parameter gives the area
-- A reasonable default is the number of vertices. -- of the square on which the vertices will be placed. A reasonable
, lgl_area :: (Int -> Double) -- ^ This parameter gives the area of the square
-- on which the vertices will be placed. A reasonable
-- default value is the number of vertices squared. -- default value is the number of vertices squared.
, lgl_coolexp :: !Double -- ^ The cooling exponent. A reasonable default value is 1.5. , lgl_coolexp :: !Double -- ^ The cooling exponent. A reasonable default value is 1.5.
, lgl_repulserad :: (Int -> Double) -- ^ Determines the radius at which vertex-vertex repulsion cancels out attraction of adjacent vertices. A reasonable default value is area times the number of vertices. , lgl_repulserad :: (Int -> Double) -- ^ Determines the radius at which
-- vertex-vertex repulsion cancels out attraction of adjacent vertices.
-- A reasonable default value is area times the number of vertices.
, lgl_cellsize :: (Int -> Double) , lgl_cellsize :: (Int -> Double)
} }
......
flags:
haskell-igraph:
graphics: true
packages: packages:
- '.' - '.'
extra-deps: [] extra-deps: []
resolver: lts-7.0 resolver: lts-7.3
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment