Want to contribute a GraphLab Create How-To? We welcome pull requests. Please read the contributor guide.

Want to request a new How-To or have feedback on one listed below? Please open a Git issue or send us feedback.

• Import data from Pandas Series/Dataframes
• Import data from your Spark cluster
• Import data from your databases using SQL
• Load a JSON file into an SFrame
• Load a collection XML files into an SFrame
• Load an Avro file into an SFrame
• Extract main article content from HTML with Boilerpipe

• Filter/Select rows from an SFrame
• Efficiently Calculating Basic Statistics in SArray/SFrame
• Find the top-k rows for each value of a group variable
• Collapse multiple columns of an SFrame into a single column of type list/dict
• Parse a datetime column into its components (year, month, etc.)
• Convert a column of datetime strings into UNIX timestamps
• Expand an SFrame column of type list/dict into multiple columns

• Join vertex data on SGraph
• Remove duplicate edges from SGraph
• Check if one SGraph is a subgraph of a second SGraph

• Find the unique words used in an SArray of text documents
• Compute word frequencies for each word in an SArray of text documents

• Convert an SArray of URL strings to an SArray of graphlab.Image
• Convert an SArray of array.array to an SArray of graphlab.Image
• Convert a PIL.Image to a graphlab.Image
• Convert a graphlab.Image to a PIL.Image

• Implement single source shortest path using triple_apply
• Implement weighted pagerank using triple_apply

• Convert an SFrame into a scipy.sparse matrix
• Compute approximate AtA sparse matrix product using the DIMSUM algorithm

• Show SGraph with custom layout using vertex_positions and NetworkX
• Show SGraph with bipartite vertex coloring
• Show SGraph with custom vertex coloring
• Show time-series data as a line chart in Canvas

• Run a function on the crossproduct of option values
• Parallel web page crawling using Dato Distributed
• Use the logging module with GraphLab Create

Code submitted through pull requests will be made available under the CC0 1.0 Universal license.