ArrayBasedDirectedGraph can be stored with neighbors sorted or not. Therefore there
are 3 strategies of loading a graph from input:
AlreadySorted - creates a graph with sorted neighbors from sorted input
SortWhileReading - creates a graph with sorted neighbors sorting them
while reading
LeaveUnsorted - creates graph with unsorted neighbors (default)
Linear Supertypes
Enumeration, Serializable, Serializable, AnyRef, Any
ArrayBasedDirectedGraph can be stored with neighbors sorted or not. Therefore there are 3 strategies of loading a graph from input:
AlreadySorted
- creates a graph with sorted neighbors from sorted inputSortWhileReading
- creates a graph with sorted neighbors sorting them while readingLeaveUnsorted
- creates graph with unsorted neighbors (default)