Given the edges of a graph, builds vertices with uniformly distributed values and dangling nodes flags.
Given the edges of a graph, builds vertices with uniformly distributed values and dangling nodes flags. This can be used as a starting point for the first iteration of PageRank.
Performance note: edges
are iterated over multiple timed, so please
consider persisting it first.
the EdgeRDD to use as the basis for the graph
the storage level to use for temporary datasets that
are created during the graph building process (we recommend using
MEMORY_ONLY
as the datasets are small)
the storage level to use for the final edges produced
the storage level to use for the final vertices produced
Loads a graph from durable storage.
Loads a graph from durable storage.
See: save for more details
Saves a graph in it's entirety to durable storage.
Saves a graph in it's entirety to durable storage.
Note that this uses "object files" and is thus loading the graph requires the samve binary version as Spark and this library that was used to save it.