diff --git a/.wordlist.txt b/.wordlist.txt index 717c358..0ee53e5 100644 --- a/.wordlist.txt +++ b/.wordlist.txt @@ -348,6 +348,9 @@ hostnames bigmac calmcode io +influencers +analytics +Pathfinding kafka readme github diff --git a/algorithms/degree.md b/algorithms/degree.md new file mode 100644 index 0000000..0108b90 --- /dev/null +++ b/algorithms/degree.md @@ -0,0 +1,170 @@ +--- +title: "Degree" +description: "Measures the number of incoming or outgoing conections for all nodes." +parent: "Algorithms" +--- + +# Degree Procedure Documentation + +## Introduction + +The **Degree Procedure** calculates the degree of nodes in a graph based on the specified parameters. +This allows users to analyze the connectivity of nodes in terms of incoming or outgoing edges, filtered by node labels and relationship types. + +--- + +## Use Cases + +Here are some practical scenarios where the **Degree Procedure** can be applied: + +1. **Social Network Analysis**: Identify influencers or highly connected individuals by calculating the degree of `Person` nodes in a social graph. +2. **Infrastructure Planning**: Determine bottlenecks in a transportation network by analyzing nodes with high incoming or outgoing connections. +3. **E-commerce Recommendations**: Identify popular products or categories by computing the degree of `Product` or `Category` nodes based on customer interactions. +4. **Fraud Detection**: Spot suspicious activities by analyzing nodes with unusually high degrees in financial transaction graphs. + +--- + +## Syntax + +The procedure has the following call signature: +```procedure input: +CALL algo.dgree({ + 'srcLabels': [