dalicious v2.4.0 (2020-01-14T14:23:24Z)
Dub
Repo
mapEdges
dalicious
math
Undocumented in source. Be warned that the author may not have intended to support it.
void
mapEdges
(
alias
fun
G
)
(
ref
G
graph
)
if
(
is
(
G
:
Graph
!
Params
,
Params
...
)
)
Meta
Source
See Implementation
dalicious
math
classes
EdgeExistsException
EmptySetException
MissingEdgeException
MissingNodeException
NodeExistsException
enums
RoundingMode
functions
N
absdiff
add
bulkAdd
ceil
ceildiv
filterEdges
findAllCliques
findCyclicSubgraphs
findMaximallyConnectedComponents
floor
histogram
inverseLogIndex
logHistogram
logIndex
longestIncreasingSubsequence
mapEdges
mean
median
structs
Graph
Histogram
NaturalNumberSet
UndirectedGraph