Package  Description 

org.deeplearning4j.graph.data 
Modifier and Type  Method and Description 

static <V,E> Graph<V,E> 
GraphLoader.loadGraph(String path,
EdgeLineProcessor<E> lineProcessor,
VertexFactory<V> vertexFactory,
int numVertices,
boolean allowMultipleEdges)
Load a graph into memory, using a given EdgeLineProcessor.

static <V,E> Graph<V,E> 
GraphLoader.loadGraph(String vertexFilePath,
String edgeFilePath,
VertexLoader<V> vertexLoader,
EdgeLineProcessor<E> edgeLineProcessor,
boolean allowMultipleEdges)
Load graph, assuming vertices are in one file and edges are in another file.

static Graph<String,String> 
GraphLoader.loadUndirectedGraphEdgeListFile(String path,
int numVertices,
String delim)
Simple method for loading an undirected graph, where the graph is represented by a edge list with one edge
per line with a delimiter in between
This method assumes that all lines in the file are of the form i<delim>j where i and j are integers
in range 0 to numVertices inclusive, and "GraphLoader.loadUndirectedGraphEdgeListFile(String, int, String, boolean) with allowMultipleEdges = true. 
static Graph<String,String> 
GraphLoader.loadUndirectedGraphEdgeListFile(String path,
int numVertices,
String delim,
boolean allowMultipleEdges)
Simple method for loading an undirected graph, where the graph is represented by a edge list with one edge
per line with a delimiter in between
This method assumes that all lines in the file are of the form i<delim>j where i and j are integers
in range 0 to numVertices inclusive, and " 
static Graph<String,Double> 
GraphLoader.loadWeightedEdgeListFile(String path,
int numVertices,
String delim,
boolean directed,
boolean allowMultipleEdges,
String... ignoreLinesStartingWith)
Method for loading a weighted graph from an edge list file, where each edge (inc. weight) is represented by a
single line.

static Graph<String,Double> 
GraphLoader.loadWeightedEdgeListFile(String path,
int numVertices,
String delim,
boolean directed,
String... ignoreLinesStartingWith)
Method for loading a weighted graph from an edge list file, where each edge (inc. weight) is represented by a
single line.

Copyright © 2020. All rights reserved.