localmotifcluster.h File Reference

#include "Snap.h"

Include dependency graph for localmotifcluster.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	ProcessedGraph
class	MAPPR

Typedefs
typedef TVec< THash< TInt, TFlt > >	WeightVH
typedef TVec< THash< TInt, TIntV > >	CountVH

Enumerations
enum	MotifType {   UniDE, BiDE, DE, DE_any,   M1, M2, M3, M4,   M5, M6, M7, triad,   cycle, FFLoop, UEdge, clique3,   clique4, clique5, clique6, clique7,   clique8, clique9, M1, M2,   M3, M4, M5, M6,   M7, M8, M9, M10,   M11, M12, M13, bifan,   semiclique, triangle, clique3, clique4,   clique5, clique6, clique7, clique8,   clique9, edge }

Functions
MotifType	ParseMotifType (const TStr &motif, const bool &IsDirected=false)

Typedef Documentation

typedef TVec< THash<TInt, TIntV> > CountVH

Definition at line 7 of file localmotifcluster.h.

typedef TVec< THash<TInt, TFlt> > WeightVH

Definition at line 6 of file localmotifcluster.h.

Enumeration Type Documentation

enum MotifType

Enumerator
UniDE
BiDE
DE
DE_any
M1
M2
M3
M4
M5
M6
M7
triad
cycle
FFLoop
UEdge
clique3
clique4
clique5
clique6
clique7
clique8
clique9
M1
M2
M3
M4
M5
M6
M7
M8
M9
M10
M11
M12
M13
bifan
semiclique
triangle
clique3
clique4
clique5
clique6
clique7
clique8
clique9
edge

Definition at line 14 of file localmotifcluster.h.

               {
  // directed graph 2-node motifs
  UniDE,      // uni-directed edge, u --> v but not v --> u
  BiDE,       // bi-directed edge, u <--> v
  DE,         // directed edge, = UniDE + 2 * BiDE
  DE_any,     // any edge, counted as 1 if(u --> v or v --> u), = UniDE + BiDE

  // directed graph 3-node motifs, see [Austin et al. 2016 Science] for more information.
  M1,         // u  --> v, v  --> w, w  --> u
  M2,         // u <--> v, v  --> w, w  --> u
  M3,         // u <--> v, v <--> w, w  --> u
  M4,         // u <--> v, v <--> w, w <--> u
  M5,         // u  --> v, v  --> w, u  --> w
  M6,         // u <--> v, w  --> u, w  --> v
  M7,         // u <--> v, u  --> w, v  --> w
  triad,      // M1 + M2 + M3 + M4 + M5 + M6 + M7
  cycle,      // M1 + M2 + M3 + 2 * M4
  FFLoop,     // feed-forward loop, M5 + 2 * M6 + 2 * M7

  // undirected graph motifs
  UEdge,      // undirected edges
  clique3,    //       |
  clique4,    //       |
  clique5,    //       |
  clique6,    //       |
  clique7,    //       |
  clique8,    //       |
  clique9,    //       |
};

Function Documentation

MotifType ParseMotifType	(	const TStr &	motif,
		const bool &	IsDirected = false
	)

Definition at line 20 of file localmotifcluster.cpp.

References BiDE, clique3, clique4, clique5, clique6, clique7, clique8, clique9, cycle, DE, DE_any, FFLoop, TStr::GetLc(), M1, M2, M3, M4, M5, M6, M7, TExcept::Throw(), triad, UEdge, and UniDE.

                                                                    {
  TStr motif_lc = motif.GetLc();
  if (IsDirected) {
    if      (motif_lc == "m1")          { return M1; }
    else if (motif_lc == "m2")          { return M2; }
    else if (motif_lc == "m3")          { return M3; }
    else if (motif_lc == "m4")          { return M4; }
    else if (motif_lc == "m5")          { return M5; }
    else if (motif_lc == "m6")          { return M6; }
    else if (motif_lc == "m7")          { return M7; }
    else if (motif_lc == "triad")          { return triad; }
    else if (motif_lc == "cycle")          { return cycle; }
    else if (motif_lc == "ffloop")          { return FFLoop; }
    else if (motif_lc == "unide")          { return UniDE; }
    else if (motif_lc == "bide")          { return BiDE; }
    else if (motif_lc == "de")          { return DE; }
    else if (motif_lc == "edge")          { return DE_any; }
    else { 
      TExcept::Throw("Unknown motif for directed graph!"); 
    }
  } else {
    if      (motif_lc == "uedge")     { return UEdge; }
    else if (motif_lc == "clique3")     { return clique3; }
    else if (motif_lc == "clique4")     { return clique4; }
    else if (motif_lc == "clique5")     { return clique5; }
    else if (motif_lc == "clique6")     { return clique6; }
    else if (motif_lc == "clique7")     { return clique7; }
    else if (motif_lc == "clique8")     { return clique8; }
    else if (motif_lc == "clique9")     { return clique9; }
    else { TExcept::Throw("Unknown motif for undirected graph!"); }
  }
  TExcept::Throw("Inappropriate input!"); 
  return UEdge;
}

Here is the call graph for this function: