edu
.
cmu
.
ml
.
rtw
.
pra
.
graphs
GraphOnDisk
Related Doc:
package graphs
class
GraphOnDisk
extends
Graph
Linear Supertypes
Graph
,
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
GraphOnDisk
Graph
AnyRef
Any
Hide All
Show all
Visibility
Public
All
Instance Constructors
new
GraphOnDisk
(
graphDir:
String
,
outputter:
Outputter
,
fileUtil:
FileUtil
=
new FileUtil
)
Value Members
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
lazy val
_entries
:
Array
[
Node
]
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
lazy val
edgeDict
:
ImmutableDictionary
val
emptyNode
:
Node
Definition Classes
Graph
def
entries
:
Array
[
Node
]
Definition Classes
GraphOnDisk
→
Graph
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
val
fileIsBinary
:
Boolean
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
getAllTriples
()
:
Seq
[(
Int
,
Int
,
Int
)]
Definition Classes
Graph
def
getAllTriplesAsStrings
()
:
Seq
[(
String
,
String
,
String
)]
Definition Classes
Graph
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getEdgeIndex
(
name:
String
)
:
Int
Definition Classes
GraphOnDisk
→
Graph
def
getEdgeName
(
i:
Int
)
:
String
Definition Classes
GraphOnDisk
→
Graph
def
getNode
(
name:
String
)
:
Node
Definition Classes
Graph
def
getNode
(
i:
Int
)
:
Node
Definition Classes
Graph
def
getNodeIndex
(
name:
String
)
:
Int
Definition Classes
GraphOnDisk
→
Graph
def
getNodeName
(
i:
Int
)
:
String
Definition Classes
GraphOnDisk
→
Graph
def
getNumEdgeTypes
()
:
Int
Definition Classes
GraphOnDisk
→
Graph
def
getNumNodes
()
:
Int
Definition Classes
GraphOnDisk
→
Graph
val
graphDir
:
String
val
graphFile
:
String
def
hasEdge
(
name:
String
)
:
Boolean
Definition Classes
GraphOnDisk
→
Graph
def
hasNode
(
name:
String
)
:
Boolean
Definition Classes
GraphOnDisk
→
Graph
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
loadGraph
()
:
Array
[
Node
]
def
loadGraphFromBinaryFile
()
:
Array
[
Node
]
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
lazy val
nodeDict
:
ImmutableDictionary
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
lazy val
numShards
:
Int
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
AnyRef → Any
final
def
wait
()
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
writeToBinaryFile
(
filename:
String
,
fileUtil:
FileUtil
=
new FileUtil
)
:
Unit
Definition Classes
Graph
def
writeToGraphChiFormat
()
:
String
Definition Classes
Graph
def
writeToGraphChiLines
()
:
Seq
[
String
]
Definition Classes
Graph
def
writeToInstanceGraph
()
:
String
Definition Classes
Graph
Inherited from
Graph
Inherited from
AnyRef
Inherited from
Any
Ungrouped