# Triangle Count in GraphX

Triangle Count is very useful in social network analysis. The triangle is a three-node small graph, where every two nodes …

Skip to content
# Simple Note

## Full of worms

# Month: March 2015

# Triangle Count in GraphX

# PageRank using Pregel API or GraphX

# Pregel and Shortest Path Algorithm in GraphX

# Graph Operators in GraphX – Part 2

# Graph Operators in GraphX – Part 1

# Data Loading in GraphX

# Create Graph in GraphX

# Graph Elements in GraphX

# Partition Strategy in GraphX

# Range Minimum Query

Triangle Count is very useful in social network analysis. The triangle is a three-node small graph, where every two nodes …

GraphX provides PageRank API for users to calculate the PageRank of a graph conveniently. The API is defined in [[lib/PageRank.scala]]. …

If you pay enough attention to Graph.scala, you may find cache function. It can cache the graph at specific storage …

Besides the operations mentioned in Part One, GraphX also defines a special data structure for node degree in GraphOps.scala, stored …

GraphX defines several operators which can process graph information. As introduced before, some operators are defined in Graph.scala, such as …

Normally, we create the graph manually only we are practicing the tutorial or doing some debugging. We prefer to read …

If you look into Graph.scala carefully, you would find method apply which can be used to construct a graph from …

In Graph.scala, it defines a abstract class Graph, representing a graph in which vertices and edges can be associate with …

To process the graph in a distributed style, the graph needs to be represented in a distributed scheme. Normally, there …

It’s also a solution to SGU 155. The problem can be viewed here. Every node has two values <k, a>, …

Close Drawer
## Simple Note