Please enable JavaScript.
Coggle requires JavaScript to display documents.
File/Network - Coggle Diagram
File/Network
Network
Multiple Relations Network
Extract Relation(s) into Seperate Network(s)
Canonical Numbering
Select Relation(s) into One Network
Generate 3-Mode Network
Line Values->Relation Numbers
Relation Numbers ->Line Values
Change Relation Number-Label
Info
2-Mode Network
2-Mode to1-Mode
Rows
Columns
Special
Columns(min)
Rows(max)
Row(min)
Columns(max)
Include Loops
Normalize 1-Mode
Cols=0
Multiple Lines
Row= Cols
Core
2-Mode Border
Valued 2-Mode Core
2-Mode Review
2-Mode
Transpose 2-Mode
Important Vertices
Partition into 2 Mode
Info
Creat Hierarchy
Make Partition
using Threshold determined by Vector
with selected Size of Clusters
Extract Subtree as Hierarchy
Run
Creat permutation
Breadth first
Strong
Weak
Reverse Cuthill-McKEE
Depth first
Strong
Weak
Core+Degree
Creat Vector
Distribution of Distances*
Generalized Core
Sum
Input
Output
All
Max(Input,Output)
Max
Output
All
Input
Degree
All
Input+Output
Output
Max(Input,Output)
Input
Structural Holes
Clustering Coefficients
CC1
CC2
Certrality
Betweeenness
Hubs-Authorities
Closeness
Input
Output
All
Proximity Prestige
Output
Input
All
Weighted Degree
Output
All
Input
Laplace
Input
Output
All
Degree
All
Output
Input
Line Values
Min
Input
Output
All
Max
Input
Output
All
Centers
Get Loops
Get Coordinate
z
Alll
y
x
Create Partition
k-Core
Input
Output
All
Valued Core
Use Max instead of Sum
Selected Thresholds
All
Output
Input
First Threshold and Step
Output
All
Input
k-Neighbours
Output
All
Input
Communities
Louvain Method
Multi-Level Coarsening+Single Refinement
Multi-Level Coarsening+Multi-Level Refinement
Vos Clustering
Multi-Level Coarsening+Single Refinement
Multi-Level Coarsening+Multi-Level Refinement
Components
Strong
Strong-Periodic
Weak
Islands
Line Weights[Simple]
Generate Network with Islands
Line Weights
Degree
Output
All
Input
Blockmodeling*
Optimize Partition
Restricted Options
Random Start
Short Report
Vertex Labels
Vertex Labels matching Regular Expression
Bow-Tie
Vertex shapes
Default Labels Partition
p-Cliques
Strong
Weak
Network
Acyclic Network
Create Permutation
Topological Ordering
Becker's Heuristic
Transform
Add Source and Sink
Preprint Transformation
Create Weighted Network+Vector
Probabilistic Flow
Traveersal Weights
Search Path Like Count(SPLC)
Search Path Count(SPC)
Search Path Node Pair(SPNP)
Normalization of Weigjts
Normalize- Flow
Normalize- Max
Without Normalization
Logarithmic Weigjts
+Partition
Createe Vectors with Genetic Structure
Create(Sub)Network
Main paths
Local Search
Forward
Backward
Key-Route
Through Vertices in Cluster
Global Search
Key-Route
Through Vertices in Cluster
Standard
Mark Main Paths as Multirelational Network
Critical Path Method-CPM
Info
Create Partition
Select First Vertices
Generational
Depth Partition
Genealogical
Generational
Acyclic
Temporal Network
Generate in Time
Only Different
Interval
All
Signed Network
Create Partition
Doreian-Mrvar method*
Zeleny Approach*
Louvain method
Multi-Level Coarsening+Single Refinement
Multi-Level Coarsening+Multi-Level Refinement
Info
Zeleny Indices
Signed Modularity
Structural Balance Inconsistency
Sighed E-Indices
Set All Positive Line Values to1,Negative ot -1
Info
Network
Creat New Network
SubNetwork with Paths
Walks with Limited Length between Two Vertics
Geodesics Matrices*
All Shortest Path between Two Vertics
Info on Diameter
One Shortest Path between Two Vertics
with Ring Counts stored as Line Values
3-Rings
Undirted
Directed
Transitive
All
Cyclic
Shortcuts
4-Rings
SubNetwork with Flows
Maximum Flow between Two Vertics
Maximum Flow between Pairs in Cluster*
with BI-Connected Components stored as Relation Number
Complete Network
Undireted
Directed
Transform
Arcs-> Edges
Bidirected only
Min Value
Max value
Sum Values
All
Bidirected Arcs-> Arc
Select Min value
Select Max value
Edges-> Arcs
Line Values
Multiply by
Constant
Min
Max
Recode
Absolute
Absolute+Sqrt
Truncate
Set All Line Values to 1
Exp
Ln
Power
Normalize
Sum
Max
Replace Arc Value with Ranks
Ascending
Descending
Add
Vertex Labels
from File(s)
and Descriptions from File(s)
Default
Line Labels as Line Values
Vertices
Sibling Edges
Input
Ooutput
Reduction
Hierarchy
Subdivisions
Pathfinder*
Design(McCabe)
Degree
Output
All
Input
Vertices in Cluster only
Structural(Flow Graph)
Remove
All Arcs
Mutiple Lines
Min Value
Max Value
Number of Lines
Sum Values
All Edges
Loops
Selected Vertics
Line with Value
higher than
lower than
within interval
all Arcs from each Vertex except
k with Highest Line Values
Keeo Arcs with Value equal to the k-th Value
k with Lowest Line Values
Triangle
lower
upper
Replace Loops with Duplication of Vertices
Duplicate only Vertices
Duplicate also Incident Lines
Transpose 1-Mode
1-Mode to 2-Mode
Incidence Network
Sort Lines
Line Values
Ascending
Descending
Line Values around Verticecs
Ascending
Descening
Neighbours around Vertices
Empty Network
Networks
Creat Random Netwrok
Bernoulli/Poisson
Scale Free
Directed
Acyclic
Undirected
Adding
Free
Bernoulli/Poisson
Directed
General
Acyclic
Bipartite
Acyclic Bipartite
Undirected
Bipartite
2-Mode
General
Small World
Vertices Output Degree
Extended Model
Total No. of Arcs