.V$      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Internal data definition(c) Ivan Lazar MiljenovicMITIvan.Miljenovic@gmail.comNone *:<=DILRAssumes n' is one of the end points of this edge. Returns a list of length 2.'Assumes all nodes are in the node list.(  !"#$%&'()*#  !"#$%(*)('   & !"#$%  !"#$%&'()*!Functions dealing with sub-graphs(c) Ivan Lazar MiljenovicMITIvan.Miljenovic@gmail.comNone<=34343434Graphs with Hashable nodes(c) Ivan Lazar MiljenovicMITIvan.Miljenovic@gmail.comNone*/2579:;<=DLRUNumber of nodesVNumber of edgesWTAssumes the Contexts describe a graph in total, with the outermost one first (i.e. buildGr (c:cs) == c d buildGr cs).`QNote that for any loops, the resultant edge will only appear once in the output E field.y#Note that for loops, the result of  will always be a G.F56789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyzT  !"56789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnoTRQ LMNOIJK FGHABCDEP<=>?@;9:78TUYX_Z[V\] ^!"SWfg5dehijk6`abclmno556789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyzGraph partitioning(c) Ivan Lazar MiljenovicMITIvan.Miljenovic@gmail.comNone*/:<=ILwFind communities in weighted graphs using the algorithm by Blondel, Guillaume, Lambiotte and Lefebvre in their paper  http://arxiv.org/abs/0803.0476/Fast unfolding of communities in large networks.Connected components(c) Ivan Lazar MiljenovicMITIvan.Miljenovic@gmail.comNoneOCalculate connected components of a graph; edge directionality doesn't matter.       !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~/unordered-graphs-0.1.0.1-61V4bCyfvDyCGJtGHI5kzpData.Graph.UnorderedData.Graph.Unordered.Internal)Data.Graph.Unordered.Algorithms.Subgraphs*Data.Graph.Unordered.Algorithms.Clustering*Data.Graph.Unordered.Algorithms.ComponentsbaseData.Functor.Identity runIdentityIdentityNodeFromgetNodeEdgeTypeAdjTypemkEdgeotherNtoEdge edgeNodes edgeTriple ValidGraphAdjSetEdgeunEdgeEdgeMapNodeMapGraphGrnodeMapedgeMapnextEdgemkSetadjCountmkGraph nodeDetailslnodesedges edgeDetailsledges edgePairs ledgePairsdegNM withNodeMap withEdgeMap$fNodeFromIdentity $fNFDataGraph $fReadGraph $fShowGraph $fEqGraph$fEqEdge $fOrdEdge $fShowEdge $fReadEdge$fHashableEdge $fEnumEdge $fBoundedEdge $fNFDataEdgesubgraph isSubGraphOf Mergeable Matchable ToContext toContext FromContext fromContext ValidContext ContextualCNodeCATypeCNLabelCELabelContextCtxtcNodecLabelcAdjDirAdjToNodeFromNode UndirEdgeUEueElemDirEdgeDEfromNodetoNode AdjLookup UndirGraphDirGraphemptyisEmptyordersizebuildGrninfohasNodenlab neighbourshasEdgeeinfoelabnodesmatchmatchAsmatchAny matchAnyAsmergemergeAsinsNodeinsEdgedelNodedelEdge delEdgeLabeldelEdgesBetweennmapnmapForemapemapFor$fFromContext(,,)$fContextual(,,)$fToContext(,,)$fFromContext(,,)0$fContextual(,,)0$fToContextContext$fFromContextContext$fContextualContext$fEdgeTypeUndirEdge$fEdgeTypeDirEdge$fNodeFromDirAdj $fEqDirEdge $fOrdDirEdge $fShowDirEdge $fReadDirEdge$fFunctorDirEdge$fGenericDirEdge$fNFDataDirEdge $fEqUndirEdge$fOrdUndirEdge$fShowUndirEdge$fReadUndirEdge$fFunctorUndirEdge$fGenericUndirEdge$fNFDataUndirEdge $fEqDirAdj $fOrdDirAdj $fShowDirAdj $fReadDirAdj$fGenericDirAdj$fNFDataDirAdj $fEqContext $fShowContext $fReadContext$fGenericContext$fNFDataContext EdgeMergeablebgll$fApplicativeStateL$fFunctorStateL$fEdgeMergeableUndirEdge$fEdgeMergeableDirEdge $fEqCommunity$fOrdCommunity$fShowCommunity$fReadCommunity$fEnumCommunity$fBoundedCommunity$fHashableCommunity $fShowCGraph $fReadCGraph $fEqCGraph components getComponentgetComponentFromStateL runStateL applyOppositeValidC CommunityCCGraphCGcomMapcGraphphaseOneinitCommunitiesmoveAlltryMovebestMovegetCdiffModularityphaseTwocompressEdgeMapmapAccumWithKeyL recurseUntil