package mutable
The mutable
package within graphalytics
contains classes, traits and objects
for graph analytics on mutable Trees, 'DAG's and Directed Graphs.
- Alphabetic
- By Inheritance
- mutable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
class
Ball
[TLabel] extends AnyRef
The
Ball
class provides an implementation for ball construction.The
Ball
class provides an implementation for ball construction. A ball consists of all vertices within a given radius of a given center.- See also
ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6691601&tag=1&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6691601%26tag%3D1
-
case class
BiconnectedComp
[TLabel](g_: Graph[TLabel]) extends Product with Serializable
The
BiconnectedComp
class provides methods for finding the cut points and blocks in undirected graphs.The
BiconnectedComp
class provides methods for finding the cut points and blocks in undirected graphs. Removal of a cut point will make the graph disconnected. Cut points and blocks are also referred to as articulation points and biconnected components, respectively.- g_
the graph whose cut points/blocks are sought
-
case class
Block
(_id: Int) extends Product with Serializable
The
Block
class is used record information about biconnected components (blocks). -
class
BoundedTreeWidthBN
extends Error
The
BoundedTreeWidthBN
class provides bounded treewidth Bayesian Networks. -
class
DualIso
[TLabel] extends GraphMatcher[TLabel]
The
DualIso
class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning. -
class
DualSim
[TLabel] extends GraphMatcher[TLabel]
The
DualSim
class provides an implementation for Dual Graph Simulation usingGraph
and is based onDualSim2
, which differs fromDualSim
by not using inverse adjacency sets ('pa') in order to save space. -
class
DualSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'DualSimCAR' classs provides an implementation for Dual Graph Simulation with CArdinality Restrictions.
-
class
Graph
[TLabel] extends Cloneable
The
Graph
class stores vertex-labeled directed graphs using an adjacency set 'ch' representation, e.g., 'ch = { {1, 2}, {0}, {1} }' means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }.The
Graph
class stores vertex-labeled directed graphs using an adjacency set 'ch' representation, e.g., 'ch = { {1, 2}, {0}, {1} }' means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }. Optionally, inverse adjacency via the 'pa' array can be stored at the cost of nearly doubling the storage requirements. ---------------------------------------------------------------------------- -
class
GraphDFS
[TLabel] extends AnyRef
The
GraphDFS
performs Depth First Search (DFS) or Breadth First Search (BFS) on a Directed Graph.The
GraphDFS
performs Depth First Search (DFS) or Breadth First Search (BFS) on a Directed Graph. The class currently supports three predicates: (1) to find a matching label, and (2) to see if a destination vertex is reachable. -
class
GraphGen
[TLabel] extends Error
The
GraphGen
object is used to build random graphs with various characteristics.The
GraphGen
object is used to build random graphs with various characteristics. Needs to generate vertex labels of various types includingInt
,Double
,String
,VectorD
based on theTLabel
type. -
class
GraphIO
[TLabel] extends Error
The
GraphIO
class is used to write digraphs to a file. -
abstract
class
GraphMatcher
[TLabel] extends AnyRef
The
GraphMatcher
abstract class serves as a template for implementing specific algorithms for graph pattern matching. -
class
GraphMetrics
[TLabel] extends AnyRef
The
GraphMetrics
class provides methods for determining graph metrics that can be efficiently computed using Breadth-First Search (BFS).The
GraphMetrics
class provides methods for determining graph metrics that can be efficiently computed using Breadth-First Search (BFS). This works for undirected graphs. If a directed graph is passed in, it will be converted to a corresponding undirected graph. -
class
GraphSim
[TLabel] extends GraphMatcher[TLabel]
The
GraphSim
class provides a second implementation for Simple Graph Simulation.The
GraphSim
class provides a second implementation for Simple Graph Simulation. It differ fromGraphSim
in the parent directory in the looping order in the main for-loop and early termination when 'phi(u)' is empty. -
class
GraphSimCAR
[TLabel] extends GraphMatcher[TLabel]
The
GraphSimCAR
class provides an implementation for Simple Graph Simulation. -
class
MDualIso
[TLabel] extends GraphMatcher[TLabel]
The
MDualIso
class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning. -
class
MDualSim
[TLabel] extends GraphMatcher[TLabel]
The
MDualSim
class provides a second implementation for Dual Graph Simulation.The
MDualSim
class provides a second implementation for Dual Graph Simulation. It differs fromDualSim
by not using inverse adjacency sets ('pa') in order to save space. -
class
MDualSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'MDualSimCAR' classs provides an implementation for Dual Graph Simulation.
The 'MDualSimCAR' classs provides an implementation for Dual Graph Simulation. with CArdinality Restrictions.
-
class
MDualSimW
[TLabel] extends GraphMatcher[TLabel]
The
MDualSimW
class provides a second implementation for Dual Graph Simulation.The
MDualSimW
class provides a second implementation for Dual Graph Simulation. It differs fromDualSim
by not using inverse adjacency sets ('pa') in order to save space. This version also supports wildcards and regex. -
class
MGraph
[TLabel] extends Graph[TLabel] with Cloneable
The
MGraph
class stores vertex/edge-labeled multi-directed graphs using an adjacency set 'ch' representation, e.g., 'ch = { {1, 2}, {0}, {1} }' means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }.The
MGraph
class stores vertex/edge-labeled multi-directed graphs using an adjacency set 'ch' representation, e.g., 'ch = { {1, 2}, {0}, {1} }' means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }. Optionally, inverse adjacency via the 'pa' array can be stored at the cost of nearly doubling the storage requirements. ---------------------------------------------------------------------------- -
class
MGraphGen
[TLabel] extends Error
The
MGraphGen
object is used to build random graph with various characteristics.The
MGraphGen
object is used to build random graph with various characteristics. Needs to generate vertex labels of various types includingInt
,Double
,String
,VectorD
based on theTLabel
type. -
class
MGraphIO
[TLabel] extends Error
The
MGraphIO
class is used to write multi-digraphs to a file. -
class
MGraphSim
extends GraphMatcher[Double]
The
MGraphSim
class provides a second implementation for Simple Graph Simulation.The
MGraphSim
class provides a second implementation for Simple Graph Simulation. It differ fromGraphSim
in the looping order in the main for-loop and early termination when 'phi(u)' is empty. -
class
MGraphSimCAR
[TLabel] extends GraphMatcher[TLabel]
The
MGraphSimCAR
class provides an implementation for Simple Graph Simulation. -
class
MStrictSim
[TLabel] extends GraphMatcher[TLabel]
The 'MStrictSim' class provides an implementation for strict simulation graph pattern matching.
The 'MStrictSim' class provides an implementation for strict simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
MStrictSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'MStrictSimCAR' class provides an implementation for strict simulation graph pattern matching.
The 'MStrictSimCAR' class provides an implementation for strict simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
MTightSim
[TLabel] extends GraphMatcher[TLabel]
The 'MTightSim' class provides an implementation for tight simulation graph pattern matching.
The 'MTightSim' class provides an implementation for tight simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
MTightSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'MTightSimCAR' class provides an implementation for tight simulation graph pattern matching.
The 'MTightSimCAR' class provides an implementation for tight simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
MinSpanningTree
extends Error
The
MinSpanningTree
class is used to build minimum cost spanning trees from graphs.The
MinSpanningTree
class is used to build minimum cost spanning trees from graphs. Edge cost/weights are given by edge labels.MinSpanningTree
implements Prim's algorithm.- See also
www.cse.ust.hk/~dekai/271/notes/L07/L07.pdf
-
class
Partition
[TLabel] extends AnyRef
The
Partition
class is used to partition large directed graphs.The
Partition
class is used to partition large directed graphs. It support the following three algorithms: 'group_ran', 'group_ord', 'group_lp'.(1) Random Partitioning - excellent balance, poor edge cuts Each vertex is given a randomly assigned integer label 'ilabel' and is grouped accordingly.
(2) Ordered Partitioning - excellence balance, edge cuts may or may not be good Each vertex is assigned an integer label 'ilabel' incrementally and is grouped accordingly, e.g., {0, 1, ..., 9}, {10, 11, ..., 19}, ...
(3) Label Propagation partitioning - fair balance, fair edge cuts Each vertex is initially given a unique integer label 'ilabel'. On each iteration, each vertex will have its 'ilabel' reassigned to the most popular/frequent 'ilabel' in its neighborhood (which includes its children, parents and itself).
- See also
research.microsoft.com/pubs/183714/Partition.pdf ----------------------------------------------------------------------------
-
case class
Query
[TLabel](triples: (TLabel, TLabel, TLabel)*)(implicit evidence$1: ClassTag[TLabel]) extends Product with Serializable
The
Query
class provides a means for entering queries as a sequence of triples.The
Query
class provides a means for entering queries as a sequence of triples. A triple may be viewed as (subject, predicate, object), (s, p, o) or (source vertex, edge, target vertex). Support for wildcards, regexes and variables are provided.- triples
the sequence of triples forming the query
-
class
SSShortestPath
extends AnyRef
The
SSShortestPath
class is used to solve shortest path problems for graphs stored in matrices.The
SSShortestPath
class is used to solve shortest path problems for graphs stored in matrices. It solves the Single-Source Shortest Path 'SSSP' problem for directed graphs (both digraphs and multi-digraphs). TheSSShortestPath
companion object is used to form a matrix from anMGraph
. ---------------------------------------------------------------------------- The edge cost/distance (must be non-negative) can be stored in either a dense or sparse matrix. Dijkstra's Algorithm is used.- See also
thescipub.com/PDF/jcssp.2013.377.382.pdf ----------------------------------------------------------------------------
en.wikipedia.org/wiki/Dijkstra%27s_algorithm ---------------------------------------------------------------------------- For multi-digraphs, each multi-edge between a pair vertices has it own edge weight (
TLabel
=VectorD
in this case). The minimum is taking when forming the corresponding matrix.
-
class
SpanningTree
extends Error
The
SpanningTree
class is used to build spanning trees from graphs. -
class
StrictSim
[TLabel] extends GraphMatcher[TLabel]
The 'StrictSim' class provides an implementation for strict simulation graph pattern matching.
The 'StrictSim' class provides an implementation for strict simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
StrictSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'StrictSimCAR' class provides an implementation for strict simulation graph pattern matching.
The 'StrictSimCAR' class provides an implementation for strict simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
TightSim
[TLabel] extends GraphMatcher[TLabel]
The 'TightSim' class provides an implementation for tight simulation graph pattern matching.
The 'TightSim' class provides an implementation for tight simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
-
class
TightSimCAR
[TLabel] extends GraphMatcher[TLabel]
The 'TightSimCAR' class provides an implementation for tight simulation graph pattern matching.
The 'TightSimCAR' class provides an implementation for tight simulation graph pattern matching. This version uses
DualSim
.- See also
hipore.com/ijbd/2014/IJBD%20Vol%201%20No%201%202014.pdf
Value Members
-
object
Ball
The
Ball
companion object provides functions involving Balls. -
object
BiconnectedCompTest
extends App
The
BiconnectedCompTest
object tests theBiconnectedComp
class.The
BiconnectedCompTest
object tests theBiconnectedComp
class.- See also
www.geeksforgeeks.org/biconnected-components > run-main scalation.graphalytics.mutable.BiconnectedCompTest
-
object
BiconnectedCompTest2
extends App
The
BiconnectedCompTest2
object tests theBiconnectedComp
class.The
BiconnectedCompTest2
object tests theBiconnectedComp
class. See Figure 7.a in- See also
pluto.huji.ac.il/~galelidan/papers/ElidanGouldJMLR.pdf > run-main scalation.graphalytics.mutable.BiconnectedCompTest2
-
object
BoundedTreeWidthBNTest
extends App
The
BoundedTreeWidthBNTest
is used to test theBoundedTreeWidthBN
class.The
BoundedTreeWidthBNTest
is used to test theBoundedTreeWidthBN
class. > run-main scalation.graphalytics.mutable.BoundedTreeWidthBNTest -
object
BoundedTreeWidthChains
The
BoundedTreeWidthChains
object is used to find bounded tree width chains to add edges to a Bayesian Network graph. -
object
Cycle
The
Cycle
object provides a means for building a precedence/directed graph and checking it for cycles.The
Cycle
object provides a means for building a precedence/directed graph and checking it for cycles. For cycle detection, vertices are marked with traffic-light colors:- GreeN means go/unexplored,
- YelloW means caution/been there before,
- ReD mean stop/already fully explored.
-
object
CycleTest
extends App
The
CycleTest
object tests theCycle
class using a label-free precedence graph.The
CycleTest
object tests theCycle
class using a label-free precedence graph. Graphs are created by passing in an array of adjacency sets (one for each vertex). > run-main scalation.graphalytics.mutable.CycleTest -
object
DualIsoTest
extends App
The
DualIsoTest
object is used to test theDualIso
class.The
DualIsoTest
object is used to test theDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest -
object
DualIsoTest2
extends App
The
DualIsoTest2
object is used to test theDualIso
class.The
DualIsoTest2
object is used to test theDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest2 -
object
DualIsoTest3
extends App
The
DualIsoTest3
object is used to test theDualIso
class.The
DualIsoTest3
object is used to test theDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest3 -
object
DualSimCARTest
extends App
The
DualSimCARTest
object is used to test theDualSimCAR
class.The
DualSimCARTest
object is used to test theDualSimCAR
class. > run-main scalation.graphalytics.mutable.DualSimCARTest -
object
DualSimCARTest2
extends App
The
DualSimCARTest2
object is used to test theDualSimCAR
class.The
DualSimCARTest2
object is used to test theDualSimCAR
class. > run-main scalation.graphalytics.mutable.DualSimCARTest2 -
object
DualSimTest
extends App
The
DualSimTest
object is used to test theDualSim
class.The
DualSimTest
object is used to test theDualSim
class. > run-main scalation.graphalytics.mutable.DualSimTest -
object
DualSimTest2
extends App
The
DualSimTest2
object is used to test theDualSim
class.The
DualSimTest2
object is used to test theDualSim
class. > run-main scalation.graphalytics.mutable.DualSimTest2 -
object
DualSimTest3
extends App
The
DualSimTest3
object is used to test the 'DualSim' class.The
DualSimTest3
object is used to test the 'DualSim' class. > run-main scalation.graphalytics.mutable.DualSimTest3 -
object
ExampleGraphD
The
ExampleGraphD
object contains example query and data digraphs in which the vertex label typeTLabel
isDouble
. -
object
ExampleGraphI
The
ExampleGraphI
object contains example query and data digraphs in which the vertex label typeTLabel
isInt
. -
object
ExampleGraphS
The
ExampleGraphS
object contains example query and data digraphs in which the vertex label typeTLabel
isString
. -
object
ExampleMGraphD
The
ExampleMGraphD
object contains example query and data multi-digraphs in which the vertex label typeTLabel
isDouble
. -
object
ExampleMGraphI
The
ExampleMGraphI
object contains example query and data multi-digraphs in which the vertex label typeTLabel
isInt
. -
object
ExampleMGraphS
The
ExampleMGraphS
object contains example query and data multi-digraphs in which the vertex label typeTLabel
isString
. -
object
Graph
The
Graph
companion object contains build methods and example query digraphs. -
object
GraphDFSTest
extends App
The
GraphDFSTest
is used to test theGraphDFS
class.The
GraphDFSTest
is used to test theGraphDFS
class. > run-main scalation.graphalytics.mutable.GraphDFSTest -
object
GraphGen
The
GraphGen
companion object provides simple methods for creating data and query graphs. -
object
GraphGenTest
extends App
The
GraphGenTest
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed.The
GraphGenTest
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs withInt
vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest -
object
GraphGenTest2
extends App
The
GraphGenTest2
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed.The
GraphGenTest2
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs withDouble
vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest2 -
object
GraphGenTest3
extends App
The
GraphGenTest3
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed.The
GraphGenTest3
object is used to test theGraphGen
class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs withString
vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest3 -
object
GraphGenTest4
extends App
The
GraphGenTest4
object is used to test theGraphGen
class for building power law graphs.The
GraphGenTest4
object is used to test theGraphGen
class for building power law graphs. > run-main scalation.graphalytics.mutable.GraphGenTest4 -
object
GraphGenTest5
extends App
The
GraphGenTest5
object is used to test theGraphGen
class for extracting query graphs from data graphs (note: data graph should be connected).The
GraphGenTest5
object is used to test theGraphGen
class for extracting query graphs from data graphs (note: data graph should be connected). > run-main scalation.graphalytics.mutable.GraphGenTest5 -
object
GraphGenTest6
extends App
The
GraphGenTest6
object is used to test theGraphGen
companion object for generating both data and query graphs.The
GraphGenTest6
object is used to test theGraphGen
companion object for generating both data and query graphs. > run-main scalation.graphalytics.mutable.GraphGenTest6 -
object
GraphGenTest7
extends App
The
GraphGenTest7
object is used to test theGraphGen
companion object for generating data graphs.The
GraphGenTest7
object is used to test theGraphGen
companion object for generating data graphs. > run-main scalation.graphalytics.mutable.GraphGenTest7 -
object
GraphIO
extends Error
The
GraphIO
object is the companion object to theGraphIO
class and is used for reading digraphs from files. -
object
GraphIOTest
extends App
The
GraphIOTest
object is used to test theGraphIO
class and object.The
GraphIOTest
object is used to test theGraphIO
class and object. > run-main scalation.graphalytics.mutable.GraphIOTest -
object
GraphMetrics
The
GraphMetrics
companion object provides basic statistics about graphs. -
object
GraphMetricsTest
extends App
The
GraphMetricsTest
object is used to test theGraphMetrics
class.The
GraphMetricsTest
object is used to test theGraphMetrics
class.- See also
http://math.stackexchange.com/questions/240556/radius-diameter-and-center-of-graph > run-main scalation.garphalytics.mutable.GraphMetricsTest
-
object
GraphSimCARTest
extends App
The
GraphSimCARTest
object is used to test theGraphSimCAR
class.The
GraphSimCARTest
object is used to test theGraphSimCAR
class. > run-main scalation.graphalytics.GraphSimCARTest -
object
GraphSimCARTest2
extends App
The
GraphSimCARTest2
object is used to test theGraphSimCAR
class.The
GraphSimCARTest2
object is used to test theGraphSimCAR
class. > run-main scalation.graphalytics.GraphSimCARTest2 -
object
GraphSimTest
extends App
The
GraphSimTest
object is used to test theGraphSim
class.The
GraphSimTest
object is used to test theGraphSim
class. > run-main scalation.graphalytics.mutable.GraphSimTest -
object
GraphSimTest2
extends App
The
GraphSimTest2
object is used to test theGraphSim
class.The
GraphSimTest2
object is used to test theGraphSim
class. > run-main scalation.graphalytics.mutable.GraphSimTest2 -
object
GraphSimTest3
extends App
The
GraphSimTest3
object is used to test theGraphSim
class.The
GraphSimTest3
object is used to test theGraphSim
class. > run-main scalation.graphalytics.mutable.GraphSimTest3 -
object
GraphTest
extends App
The
GraphTest
object is used to test theGraph
class using example digraphs from theExampleGraphI
object, which contains graph whose vertex labels are of typeInt
.The
GraphTest
object is used to test theGraph
class using example digraphs from theExampleGraphI
object, which contains graph whose vertex labels are of typeInt
. > run-main scalation.graphalytics.mutable.GraphTest -
object
GraphTest2
extends App
The
GraphTest2
object is used to test theGraph
class using example digraphs from theExampleGraphD
object, which contains graph whose vertex labels are of typeDouble
.The
GraphTest2
object is used to test theGraph
class using example digraphs from theExampleGraphD
object, which contains graph whose vertex labels are of typeDouble
. > run-main scalation.graphalytics.mutable.GraphTest2 -
object
GraphTest3
extends App
The
GraphTest3
object is used to test theGraph
class using the digraphs given in theGraph
companion object.The
GraphTest3
object is used to test theGraph
class using the digraphs given in theGraph
companion object. > run-main scalation.graphalytics.mutable.GraphTest3 -
object
GraphTest4
extends App
The
GraphTest4
object is used to test theGraph
class using a randomly generated digraph.The
GraphTest4
object is used to test theGraph
class using a randomly generated digraph. > run-main scalation.graphalytics.mutable.GraphTest4 -
object
GraphTest5
extends App
The
GraphTest5
object is used to test theGraph
class by calling the apply in theGraph
companion object.The
GraphTest5
object is used to test theGraph
class by calling the apply in theGraph
companion object. > run-main scalation.graphalytics.mutable.GraphTest5 -
object
LabelFunctions
The
LabelFunctions
object provides methods for obtaining child and parents labels for the corresponding data and query graphs. -
object
MDualIsoTest
extends App
The
MDualIsoTest
object is used to test theMDualIso
class.The
MDualIsoTest
object is used to test theMDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest -
object
MDualIsoTest2
extends App
The
MDualIsoTest2
object is used to test theMDualIso
class.The
MDualIsoTest2
object is used to test theMDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest2 -
object
MDualIsoTest3
extends App
The
MDualIsoTest3
object is used to test theMDualIso
class.The
MDualIsoTest3
object is used to test theMDualIso
class. > run-main scalation.graphalytics.mutable.DualIsoTest3 -
object
MDualSimCARTest
extends App
The
MDualSimCARTest
object is used to test theMDualSimCAR
class.The
MDualSimCARTest
object is used to test theMDualSimCAR
class. > run-main scalation.graphalytics.mutable.MDualSimCARTest -
object
MDualSimCARTest2
extends App
The
MDualSimCARTest2
object is used to test theMDualSimCAR
class.The
MDualSimCARTest2
object is used to test theMDualSimCAR
class. > run-main scalation.graphalytics.mutable.MDualSimCARTest2 -
object
MDualSimTest
extends App
The
MDualSimTest
object is used to test theMDualSim
class.The
MDualSimTest
object is used to test theMDualSim
class. run-main scalation.graphalytics.mutable.MDualSimTest -
object
MDualSimWTest
extends App
The
MDualSimWTest
object is used to test theMDualSimW
class.The
MDualSimWTest
object is used to test theMDualSimW
class. run-main scalation.graphalytics.mutable.MDualSimWTest -
object
MGraph
The
MGraph
companion object provides builder methods and example query multi-digraphs. -
object
MGraphGen
The
MGraphGen
companion object provides simple methods for creating data and query graphs. -
object
MGraphGenTest
extends App
The 'MGraphGenTest' object is used to test the 'MGraphGen' class for building random graphs where a vertex's degree is uniformly distributed.
The 'MGraphGenTest' object is used to test the 'MGraphGen' class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs with
Int
vertex/edge labels. > run-main scalation.graphalytics.mutable.MGraphGenTest -
object
MGraphGenTest2
extends App
The
MGraphGenTest2
object is used to test theMGraphGen
class for building random graphs where a vertex's degree is uniformly distributed.The
MGraphGenTest2
object is used to test theMGraphGen
class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs withDouble
vertex/edge labels. > run-main scalation.graphalytics.mutable.MGraphGenTest2 -
object
MGraphGenTest3
extends App
The
MGraphGenTest3
object is used to test theMGraphGen
class for building random graphs where a vertex's degree is uniformly distributed.The
MGraphGenTest3
object is used to test theMGraphGen
class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs withString
vertex/edge labels. > run-main scalation.graphalytics.mutable.MGraphGenTest3 -
object
MGraphGenTest4
extends App
The 'MGraphGenTest4' object is used to test the 'MGraphGen' class for building power law graphs.
The 'MGraphGenTest4' object is used to test the 'MGraphGen' class for building power law graphs. > run-main scalation.graphalytics.mutable.MGraphGenTest4
-
object
MGraphGenTest5
extends App
The
MGraphGenTest5
object is used to test theMGraphGen
class for extracting query graphs from data graphs (note: data graph should be connected).The
MGraphGenTest5
object is used to test theMGraphGen
class for extracting query graphs from data graphs (note: data graph should be connected). > run-main scalation.graphalytics.mutable.MGraphGenTest5 -
object
MGraphGenTest6
extends App
The
MGraphGenTest6
object is used to test theMGraphGen
companion object for generating both data and query graphs.The
MGraphGenTest6
object is used to test theMGraphGen
companion object for generating both data and query graphs. > run-main scalation.graphalytics.mutable.MGraphGenTest6 -
object
MGraphGenTest7
extends App
The
MGraphGenTest7
object is used to test theMGraphGen
companion object for generating data graphs.The
MGraphGenTest7
object is used to test theMGraphGen
companion object for generating data graphs. > run-main scalation.graphalytics.mutable.MGraphGenTest7 -
object
MGraphIO
extends Error
The
MGraphIO
object is the companion object to theMGraphIO
class and is used for reading graphs from files or graph databases. -
object
MGraphIOTest
extends App
The
MGraphIOTest
object is used to test theMGraphIO
class and object.The
MGraphIOTest
object is used to test theMGraphIO
class and object. > run-main scalation.graphalytics.mutable.MGraphIOTest -
object
MGraphSimCARTest
extends App
The
MGraphSimCARTest
object is used to test theMGraphSimCAR
class.The
MGraphSimCARTest
object is used to test theMGraphSimCAR
class. > run-main scalation.graphalytics.mutable.MGraphSimCARTest -
object
MGraphSimCARTest2
extends App
The
MGraphSimCARTest2
object is used to test theMGraphSimCAR
class.The
MGraphSimCARTest2
object is used to test theMGraphSimCAR
class. > run-main scalation.graphalytics.mutable.MGraphSimCARTest2 -
object
MGraphSimTest
extends App
The
MGraphSimTest
object is used to test theMGraphSim
class.The
MGraphSimTest
object is used to test theMGraphSim
class. > run-main scalation.graphalytics.mutable.MGraphSimTest -
object
MGraphTest
extends App
The
MGraphTest
object is used to test theMGraph
class using examples from theExampleMGraphI
object, which contains multi-digraphs whose vertex and edge labels are of typeInt
.The
MGraphTest
object is used to test theMGraph
class using examples from theExampleMGraphI
object, which contains multi-digraphs whose vertex and edge labels are of typeInt
. > run-main scalation.graphalytics.mutable.MGraphTest -
object
MGraphTest2
extends App
The
MGraphTest2
object is used to test theMGraph
class using examples from theExampleMGraphD
object, which contains multi-digraphs whose vertex and edge labels are of typeDouble
.The
MGraphTest2
object is used to test theMGraph
class using examples from theExampleMGraphD
object, which contains multi-digraphs whose vertex and edge labels are of typeDouble
. > run-main scalation.graphalytics.mutable.MGraphTest2 -
object
MGraphTest3
extends App
The
MGraphTest3
object is used to test theMGraph
class using a randomly generated multi-digraph.The
MGraphTest3
object is used to test theMGraph
class using a randomly generated multi-digraph. > run-main scalation.graphalytics.mutable.MGraphTest3 -
object
MStrictSimCARTest
extends App
The
MStrictSimCARTest
object is used to test theMStrictSimCAR
class.The
MStrictSimCARTest
object is used to test theMStrictSimCAR
class. > run-main scalation.graphalytics.mutable.MStrictSimCARTest -
object
MStrictSimCARTest2
extends App
The
MStrictSimCARTest2
object is used to test theMStrictSimCAR
class.The
MStrictSimCARTest2
object is used to test theMStrictSimCAR
class. > run-main scalation.graphalytics.mutable.MStrictSimCARTest2 -
object
MStrictSimCARTest3
extends App
The
MStrictSimCARTest3
object tests theMStrictSimCAR
class by passing data graph and query graph relative file paths.The
MStrictSimCARTest3
object tests theMStrictSimCAR
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.MStrictSimCARTest3 -
object
MStrictSimTest
extends App
The
MStrictSimTest
object is used to test theMStrictSim
class.The
MStrictSimTest
object is used to test theMStrictSim
class. > run-main scalation.graphalytics.mutable.MStrictSimTest -
object
MStrictSimTest2
extends App
The
MStrictSimTest2
object is used to test theMStrictSim
class.The
MStrictSimTest2
object is used to test theMStrictSim
class. > run-main scalation.graphalytics.mutable.MStrictSimTest2 -
object
MStrictSimTest3
extends App
The
MStrictSimTest3
object tests theMStrictSim
class by passing data graph and query graph relative file paths.The
MStrictSimTest3
object tests theMStrictSim
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.MStrictSimTest3 -
object
MTightSimCARTest
extends App
The
MTightSimCARTest
object is used to test theMTightSimCAR
class.The
MTightSimCARTest
object is used to test theMTightSimCAR
class. > run-main scalation.graphalytics.mutable.MTightSimCARTest -
object
MTightSimCARTest2
extends App
The
MTightSimCARTest2
object is used to test theMTightSimCAR
class.The
MTightSimCARTest2
object is used to test theMTightSimCAR
class. > run-main scalation.graphalytics.mutable.MTightSimCARTest2 -
object
MTightSimTest
extends App
The
MTightSimTest
object is used to test theMTightSim
class.The
MTightSimTest
object is used to test theMTightSim
class. > run-main scalation.graphalytics.mutable.MTightSimTest -
object
MTightSimTest2
extends App
The
MTightSimTest2
object is used to test theMTightSim
class.The
MTightSimTest2
object is used to test theMTightSim
class. > run-main scalation.graphalytics.mutable.MTightSimTest2 -
object
MTightSimTest3
extends App
The
MTightSimTest3
object test theMTightSim
class by passing data graph and query graph relative file paths.The
MTightSimTest3
object test theMTightSim
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.MTightSimTest3 -
object
MinSpanningTreeTest
extends App
The
MinSpanningTreeTest
object is used to test theMinSpanningTree
class.The
MinSpanningTreeTest
object is used to test theMinSpanningTree
class. > run-main scalation.graphalytics.mutable.MinSpanningTreeTest -
object
MinSpanningTreeTest2
extends App
The
MinSpanningTreeTest2
object is used to test theMinSpanningTree
class.The
MinSpanningTreeTest2
object is used to test theMinSpanningTree
class.- See also
www.cse.ust.hk/~dekai/271/notes/L07/L07.pdf > run-main scalation.graphalytics.mutable.MinSpanningTreeTest2
-
object
MinSpanningTreeTest3
extends App
The
MinSpanningTreeTest3
object is used to test theMinSpanningTree
class.The
MinSpanningTreeTest3
object is used to test theMinSpanningTree
class. This test the Maximum Spanning Tree option.- See also
www.cse.ust.hk/~dekai/271/notes/L07/L07.pdf > run-main scalation.graphalytics.mutable.MinSpanningTreeTest3
-
object
PartitionTest
extends App
The
PartitionTest
object is used to test thePartition
class.The
PartitionTest
object is used to test thePartition
class. This test uses random partitioning. > run-main scalation.graphalytics.mutable.PartitionTest -
object
PartitionTest2
extends App
The
PartitionTest2
object is used to test thePartition
class.The
PartitionTest2
object is used to test thePartition
class. This test uses ordered partitioning. > run-main scalation.graphalytics.mutable.PartitionTest2 -
object
PartitionTest3
extends App
The
PartitionTest3
object is used to test thePartition
class.The
PartitionTest3
object is used to test thePartition
class. This test uses label propagation for partitioning. > run-main scalation.graphalytics.mutable.PartitionTest3 -
object
Query
extends Serializable
The
Query
companion object provides methods that work on triples. -
object
QueryTest
extends App
The
QueryTest
object is used to test theQuery
class.The
QueryTest
object is used to test theQuery
class. It converts a sequence of triples into a graph. > run-main scalation.graphalytics.mutable.QueryTest -
object
QueryTest2
extends App
The
QueryTest2
object is used to test theQuery
class.The
QueryTest2
object is used to test theQuery
class. It checks if variables or wildcards exist in a triple's labels. > run-main scalation.graphalytics.mutable.QueryTest2 -
object
QueryTest3
extends App
The
QueryTest3
object is used to test theQuery
class.The
QueryTest3
object is used to test theQuery
class. It converts a sequence of triples into a graph. > run-main scalation.graphalytics.mutable.QueryTest3 -
object
SSShortestPath
The
SSShortestPath
companion object provides factory methods for theSSShortestPath
class. -
object
SSShortestPathTest
extends App
The
SSShortestPathTest
object is used to test theSSShortestPath
class.The
SSShortestPathTest
object is used to test theSSShortestPath
class. Input is in the form of matrices (MatrixD
orSparseMatrixD
). > run-main scalation.graphalytics.mutable.SSShortestPathTest -
object
SSShortestPathTest2
extends App
The
SSShortestPathTest2
object is used to test theSSShortestPath
class.The
SSShortestPathTest2
object is used to test theSSShortestPath
class. Input is in the form of graphs (MGraph
).- See also
http://thescipub.com/PDF/jcssp.2013.377.382.pdf (Fig. 1) > run-main scalation.graphalytics.mutable.SSShortestPathTest2
-
object
SpanningTreeTest
extends App
The
SpanningTreeTest
object is used to test theSpanningTree
class.The
SpanningTreeTest
object is used to test theSpanningTree
class. > run-main scalation.graphalytics.mutable.SpanningTreeTest -
object
StrictSimCARTest
extends App
The
StrictSimCARTest
object is used to test theStrictSimCAR
class.The
StrictSimCARTest
object is used to test theStrictSimCAR
class. > run-main scalation.graphalytics.mutable.StrictSimCARTest -
object
StrictSimCARTest2
extends App
The
StrictSimCARTest2
object is used to test theStrictSimCAR
class.The
StrictSimCARTest2
object is used to test theStrictSimCAR
class. > run-main scalation.graphalytics.mutable.StrictSimCARTest2 -
object
StrictSimCARTest3
extends App
The
StrictSimCARTest3
object tests theStrictSimCAR
class by passing data graph and query graph relative file paths.The
StrictSimCARTest3
object tests theStrictSimCAR
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.StrictSimCARTest3 -
object
StrictSimTest
extends App
The
StrictSimTest
object is used to test theStrictSim
class.The
StrictSimTest
object is used to test theStrictSim
class. > run-main scalation.graphalytics.mutable.StrictSimTest -
object
StrictSimTest2
extends App
The
StrictSimTest2
object is used to test theStrictSim
class.The
StrictSimTest2
object is used to test theStrictSim
class. > run-main scalation.graphalytics.mutable.StrictSimTest2 -
object
StrictSimTest4
extends App
The
StrictSimTest3
object tests theStrictSim
class by passing data graph and query graph relative file paths.The
StrictSimTest3
object tests theStrictSim
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.StrictSimTest3 -
object
TightSimCARTest
extends App
The
TightSimCARTest
object is used to test theTightSimCAR
class.The
TightSimCARTest
object is used to test theTightSimCAR
class. > run-main scalation.graphalytics.mutable.TightSimCARTest -
object
TightSimCARTest2
extends App
The
TightSimCARTest2
object is used to test theTightSimCAR
class.The
TightSimCARTest2
object is used to test theTightSimCAR
class. > run-main scalation.graphalytics.mutable.TightSimCARTest2 -
object
TightSimTest
extends App
The
TightSimTest
object is used to test theTightSim
class.The
TightSimTest
object is used to test theTightSim
class. > run-main scalation.graphalytics.mutable.TightSimTest -
object
TightSimTest2
extends App
The
TightSimTest2
object is used to test theTightSim
class.The
TightSimTest2
object is used to test theTightSim
class. > run-main scalation.graphalytics.mutable.TightSimTest2 -
object
TightSimTest3
extends App
The
TightSimTest3
object test theTightSim
class by passing data graph and query graph relative file paths.The
TightSimTest3
object test theTightSim
class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.TightSimTest3 -
object
TopSort
The
TopSort
object provides the 'topSort' method for creating a topological sort of the vertices in a directed graph.The
TopSort
object provides the 'topSort' method for creating a topological sort of the vertices in a directed graph. It also perform cycle detection. -
object
TopSortTest
extends App
The
TopSortTest
object tests theTopSort
object using a directed graph.The
TopSortTest
object tests theTopSort
object using a directed graph. Graphs are created by passing in an array of adjacency sets (one for each vertex). > run-main scalation.graphalytics.mutable.TopSortTest