Packages

package mutable

The mutable package within graphalytics contains classes, traits and objects for graph analytics on mutable Trees, 'DAG's and Directed Graphs.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. mutable
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. 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

  2. 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

  3. case class Block (_id: Int) extends Product with Serializable

    The Block class is used record information about biconnected components (blocks).

  4. class BoundedTreeWidthBN extends Error

    The BoundedTreeWidthBN class provides bounded treewidth Bayesian Networks.

  5. class DualIso [TLabel] extends GraphMatcher[TLabel]

    The DualIso class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning.

  6. class DualSim [TLabel] extends GraphMatcher[TLabel]

    The DualSim class provides an implementation for Dual Graph Simulation using Graph and is based on DualSim2, which differs from DualSim by not using inverse adjacency sets ('pa') in order to save space.

  7. class DualSimCAR [TLabel] extends GraphMatcher[TLabel]

    The 'DualSimCAR' classs provides an implementation for Dual Graph Simulation.

  8. 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. ----------------------------------------------------------------------------

  9. 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.

  10. 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 including Int, Double, String, VectorD based on the TLabel type.

  11. class GraphIO [TLabel] extends Error

    The GraphIO class is used to write digraphs to a file.

  12. abstract class GraphMatcher [TLabel] extends AnyRef

    The GraphMatcher abstract class serves as a template for implementing specific algorithms for graph pattern matching.

  13. 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.

  14. 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 from GraphSim in the parent directory in the looping order in the main for-loop and early termination when 'phi(u)' is empty.

  15. class GraphSimCAR [TLabel] extends GraphMatcher[TLabel]

    The GraphSimCAR class provides an implementation for Simple Graph Simulation.

  16. class MDualIso [TLabel] extends GraphMatcher[TLabel]

    The MDualIso class provides an implementation for Subgraph Isomorphism that uses Dual Graph Simulation for pruning.

  17. 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 from DualSim by not using inverse adjacency sets ('pa') in order to save space.

  18. class MDualSimCAR [TLabel] extends GraphMatcher[TLabel]

    The 'MDualSimCAR' classs provides an implementation for Dual Graph Simulation.

  19. 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 from DualSim by not using inverse adjacency sets ('pa') in order to save space. This version also supports wildcards and regex.

  20. 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. ----------------------------------------------------------------------------

  21. class MGraphGen [TLabel] extends AnyRef

    The MGraphGen object is used to build random graph with various characteristics.

  22. class MGraphIO [TLabel] extends Error

    The MGraphIO class is used to write multi-digraphs to a file.

  23. 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 from GraphSim in the looping order in the main for-loop and early termination when 'phi(u)' is empty.

  24. class MGraphSimCAR [TLabel] extends GraphMatcher[TLabel]

    The MGraphSimCAR class provides an implementation for Simple Graph Simulation.

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 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 ----------------------------------------------------------------------------

  31. 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

  32. 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). The SSShortestPath companion object is used to form a matrix from an MGraph. ---------------------------------------------------------------------------- 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.

  33. class SpanningTree extends Error

    The SpanningTree class is used to build spanning trees from graphs.

  34. 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

  35. 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

  36. 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

  37. 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

  1. object BiconnectedCompTest extends App

    The BiconnectedCompTest object tests the BiconnectedComp class.

    The BiconnectedCompTest object tests the BiconnectedComp class.

    See also

    www.geeksforgeeks.org/biconnected-components > run-main scalation.graphalytics.mutable.BiconnectedCompTest

  2. object BiconnectedCompTest2 extends App

    The BiconnectedCompTest2 object tests the BiconnectedComp class.

    The BiconnectedCompTest2 object tests the BiconnectedComp class. See Figure 7.a in

    See also

    pluto.huji.ac.il/~galelidan/papers/ElidanGouldJMLR.pdf > run-main scalation.graphalytics.mutable.BiconnectedCompTest2

  3. object BoundedTreeWidthBNTest extends App

    The BoundedTreeWidthBNTest is used to test the BoundedTreeWidthBN class.

    The BoundedTreeWidthBNTest is used to test the BoundedTreeWidthBN class. > run-main scalation.graphalytics.mutable.BoundedTreeWidthBNTest

  4. object BoundedTreeWidthChains

    The BoundedTreeWidthChains object is used to find bounded tree width chains to add edges to a Bayesian Network graph.

  5. 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.
  6. object CycleTest extends App

    The CycleTest object tests the Cycle class using a label-free precedence graph.

    The CycleTest object tests the Cycle 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

  7. object DualIsoTest extends App

    The DualIsoTest object is used to test the DualIso class.

    The DualIsoTest object is used to test the DualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest

  8. object DualIsoTest2 extends App

    The DualIsoTest2 object is used to test the DualIso class.

    The DualIsoTest2 object is used to test the DualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest2

  9. object DualIsoTest3 extends App

    The DualIsoTest3 object is used to test the DualIso class.

    The DualIsoTest3 object is used to test the DualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest3

  10. object DualSimCARTest extends App

    The DualSimCARTest object is used to test the DualSimCAR class.

    The DualSimCARTest object is used to test the DualSimCAR class. > run-main scalation.graphalytics.mutable.DualSimCARTest

  11. object DualSimCARTest2 extends App

    The DualSimCARTest2 object is used to test the DualSimCAR class.

    The DualSimCARTest2 object is used to test the DualSimCAR class. > run-main scalation.graphalytics.mutable.DualSimCARTest2

  12. object DualSimTest extends App

    The DualSimTest object is used to test the DualSim class.

    The DualSimTest object is used to test the DualSim class. > run-main scalation.graphalytics.mutable.DualSimTest

  13. object DualSimTest2 extends App

    The DualSimTest2 object is used to test the DualSim class.

    The DualSimTest2 object is used to test the DualSim class. > run-main scalation.graphalytics.mutable.DualSimTest2

  14. 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

  15. object ExampleGraphD

    The ExampleGraphD object contains example query and data digraphs in which the vertex label type TLabel is Double.

  16. object ExampleGraphI

    The ExampleGraphI object contains example query and data digraphs in which the vertex label type TLabel is Int.

  17. object ExampleGraphS

    The ExampleGraphS object contains example query and data digraphs in which the vertex label type TLabel is String.

  18. object ExampleMGraphD

    The ExampleMGraphD object contains example query and data multi-digraphs in which the vertex label type TLabel is Double.

  19. object ExampleMGraphI

    The ExampleMGraphI object contains example query and data multi-digraphs in which the vertex label type TLabel is Int.

  20. object ExampleMGraphS

    The ExampleMGraphS object contains example query and data multi-digraphs in which the vertex label type TLabel is String.

  21. object Graph

    The Graph companion object contains build methods and example query digraphs.

  22. object GraphDFSTest extends App

    The GraphDFSTest is used to test the GraphDFS class.

    The GraphDFSTest is used to test the GraphDFS class. > run-main scalation.graphalytics.mutable.GraphDFSTest

  23. object GraphGenTest extends App

    The GraphGenTest object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed.

    The GraphGenTest object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs with Int vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest

  24. object GraphGenTest2 extends App

    The GraphGenTest2 object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed.

    The GraphGenTest2 object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs with Double vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest2

  25. object GraphGenTest3 extends App

    The GraphGenTest3 object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed.

    The GraphGenTest3 object is used to test the GraphGen class for building random graphs where a vertex's degree is uniformly distributed. This work build graphs with String vertex labels. > run-main scalation.graphalytics.mutable.GraphGenTest3

  26. object GraphGenTest4 extends App

    The GraphGenTest4 object is used to test the GraphGen class for building power law graphs.

    The GraphGenTest4 object is used to test the GraphGen class for building power law graphs. > run-main scalation.graphalytics.mutable.GraphGenTest4

  27. object GraphGenTest5 extends App

    The GraphGenTest5 object is used to test the GraphGen class for extracting query graphs from data graphs.

    The GraphGenTest5 object is used to test the GraphGen class for extracting query graphs from data graphs. > run-main scalation.graphalytics.mutable.GraphGenTest5

  28. object GraphIO extends Error

    The GraphIO object is the companion object to the GraphIO class and is used for reading digraphs from files.

  29. object GraphIOTest extends App

    The GraphIOTest object is used to test the GraphIO class and object.

    The GraphIOTest object is used to test the GraphIO class and object. > run-main scalation.graphalytics.mutable.GraphIOTest

  30. object GraphMetricsTest extends App

    The GraphMetricsTest object is used to test the GraphMetrics class.

    The GraphMetricsTest object is used to test the GraphMetrics class.

    See also

    http://math.stackexchange.com/questions/240556/radius-diameter-and-center-of-graph

  31. object GraphSimCARTest extends App

    The GraphSimCARTest object is used to test the GraphSimCAR class.

    The GraphSimCARTest object is used to test the GraphSimCAR class. > run-main scalation.graphalytics.GraphSimCARTest

  32. object GraphSimCARTest2 extends App

    The GraphSimCARTest2 object is used to test the GraphSimCAR class.

    The GraphSimCARTest2 object is used to test the GraphSimCAR class. > run-main scalation.graphalytics.GraphSimCARTest2

  33. object GraphSimTest extends App

    The GraphSimTest object is used to test the GraphSim class.

    The GraphSimTest object is used to test the GraphSim class. > run-main scalation.graphalytics.mutable.GraphSimTest

  34. object GraphSimTest2 extends App

    The GraphSimTest2 object is used to test the GraphSim class.

    The GraphSimTest2 object is used to test the GraphSim class. > run-main scalation.graphalytics.mutable.GraphSimTest2

  35. object GraphSimTest3 extends App

    The GraphSimTest3 object is used to test the GraphSim class.

    The GraphSimTest3 object is used to test the GraphSim class. > run-main scalation.graphalytics.mutable.GraphSimTest3

  36. object GraphTest extends App

    The GraphTest object is used to test the Graph class using example digraphs from the ExampleGraphI object, which contains graph whose vertex labels are of type Int.

    The GraphTest object is used to test the Graph class using example digraphs from the ExampleGraphI object, which contains graph whose vertex labels are of type Int. > run-main scalation.graphalytics.mutable.GraphTest

  37. object GraphTest2 extends App

    The GraphTest2 object is used to test the Graph class using example digraphs from the ExampleGraphD object, which contains graph whose vertex labels are of type Double.

    The GraphTest2 object is used to test the Graph class using example digraphs from the ExampleGraphD object, which contains graph whose vertex labels are of type Double. > run-main scalation.graphalytics.mutable.GraphTest2

  38. object GraphTest3 extends App

    The GraphTest3 object is used to test the Graph class using the digraphs given in the Graph companion object.

    The GraphTest3 object is used to test the Graph class using the digraphs given in the Graph companion object. > run-main scalation.graphalytics.mutable.GraphTest3

  39. object GraphTest4 extends App

    The GraphTest4 object is used to test the Graph class using a randomly generated digraph.

    The GraphTest4 object is used to test the Graph class using a randomly generated digraph. > run-main scalation.graphalytics.mutable.GraphTest4

  40. object GraphTest5 extends App

    The GraphTest5 object is used to test the Graph class by calling the apply in the Graph companion object.

    The GraphTest5 object is used to test the Graph class by calling the apply in the Graph companion object. > run-main scalation.graphalytics.mutable.GraphTest5

  41. object LabelFunctions

    The LabelFunctions object provides methods for obtaining child and parents labels for the corresponding data and query graphs.

  42. object MDualIsoTest extends App

    The MDualIsoTest object is used to test the MDualIso class.

    The MDualIsoTest object is used to test the MDualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest

  43. object MDualIsoTest2 extends App

    The MDualIsoTest2 object is used to test the MDualIso class.

    The MDualIsoTest2 object is used to test the MDualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest2

  44. object MDualIsoTest3 extends App

    The MDualIsoTest3 object is used to test the MDualIso class.

    The MDualIsoTest3 object is used to test the MDualIso class. > run-main scalation.graphalytics.mutable.DualIsoTest3

  45. object MDualSimCARTest extends App

    The MDualSimCARTest object is used to test the MDualSimCAR class.

    The MDualSimCARTest object is used to test the MDualSimCAR class. > run-main scalation.graphalytics.mutable.MDualSimCARTest

  46. object MDualSimCARTest2 extends App

    The MDualSimCARTest2 object is used to test the MDualSimCAR class.

    The MDualSimCARTest2 object is used to test the MDualSimCAR class. > run-main scalation.graphalytics.mutable.MDualSimCARTest2

  47. object MDualSimTest extends App

    The MDualSimTest object is used to test the MDualSim class.

    The MDualSimTest object is used to test the MDualSim class. run-main scalation.graphalytics.mutable.MDualSimTest

  48. object MDualSimWTest extends App

    The MDualSimWTest object is used to test the MDualSimW class.

    The MDualSimWTest object is used to test the MDualSimW class. run-main scalation.graphalytics.mutable.MDualSimWTest

  49. object MGraph

    The MGraph companion object provides builder methods and example query multi-digraphs.

  50. 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. > run-main scalation.graphalytics.mutable.MGraphGenTest

  51. object MGraphGenTest2 extends App

    The 'MGraphGenTest2' object is used to test the 'MGraphGen' class for building power law graphs.

    The 'MGraphGenTest2' object is used to test the 'MGraphGen' class for building power law graphs. > run-main scalation.graphalytics.mutable.MGraphGenTest2

  52. object MGraphGenTest3 extends App

    The MGraphGenTest3 object is used to test the MGraphGen class for extracting query graphs from data graphs.

    The MGraphGenTest3 object is used to test the MGraphGen class for extracting query graphs from data graphs. > run-main scalation.graphalytics.mutable.MGraphGenTest3

  53. object MGraphIO extends Error

    The MGraphIO object is the companion object to the MGraphIO class and is used for reading graphs from files or graph databases.

  54. object MGraphIOTest extends App

    The MGraphIOTest object is used to test the MGraphIO class and object.

    The MGraphIOTest object is used to test the MGraphIO class and object. > run-main scalation.graphalytics.mutable.MGraphIOTest

  55. object MGraphSimCARTest extends App

    The MGraphSimCARTest object is used to test the MGraphSimCAR class.

    The MGraphSimCARTest object is used to test the MGraphSimCAR class. > run-main scalation.graphalytics.mutable.MGraphSimCARTest

  56. object MGraphSimCARTest2 extends App

    The MGraphSimCARTest2 object is used to test the MGraphSimCAR class.

    The MGraphSimCARTest2 object is used to test the MGraphSimCAR class. > run-main scalation.graphalytics.mutable.MGraphSimCARTest2

  57. object MGraphSimTest extends App

    The MGraphSimTest object is used to test the MGraphSim class.

    The MGraphSimTest object is used to test the MGraphSim class. > run-main scalation.graphalytics.mutable.MGraphSimTest

  58. object MGraphTest extends App

    The MGraphTest object is used to test the MGraph class using examples from the ExampleMGraphI object, which contains multi-digraphs whose vertex and edge labels are of type Int.

    The MGraphTest object is used to test the MGraph class using examples from the ExampleMGraphI object, which contains multi-digraphs whose vertex and edge labels are of type Int. > run-main scalation.graphalytics.mutable.MGraphTest

  59. object MGraphTest2 extends App

    The MGraphTest2 object is used to test the MGraph class using examples from the ExampleMGraphD object, which contains multi-digraphs whose vertex and edge labels are of type Double.

    The MGraphTest2 object is used to test the MGraph class using examples from the ExampleMGraphD object, which contains multi-digraphs whose vertex and edge labels are of type Double. > run-main scalation.graphalytics.mutable.MGraphTest2

  60. object MGraphTest3 extends App

    The MGraphTest3 object is used to test the MGraph class using a randomly generated multi-digraph.

    The MGraphTest3 object is used to test the MGraph class using a randomly generated multi-digraph. > run-main scalation.graphalytics.mutable.MGraphTest3

  61. object MStrictSimCARTest extends App

    The MStrictSimCARTest object is used to test the MStrictSimCAR class.

    The MStrictSimCARTest object is used to test the MStrictSimCAR class. > run-main scalation.graphalytics.mutable.MStrictSimCARTest

  62. object MStrictSimCARTest2 extends App

    The MStrictSimCARTest2 object is used to test the MStrictSimCAR class.

    The MStrictSimCARTest2 object is used to test the MStrictSimCAR class. > run-main scalation.graphalytics.mutable.MStrictSimCARTest2

  63. object MStrictSimTest extends App

    The MStrictSimTest object is used to test the MStrictSim class.

    The MStrictSimTest object is used to test the MStrictSim class. > run-main scalation.graphalytics.mutable.MStrictSimTest

  64. object MStrictSimTest2 extends App

    The MStrictSimTest2 object is used to test the MStrictSim class.

    The MStrictSimTest2 object is used to test the MStrictSim class. > run-main scalation.graphalytics.mutable.MStrictSimTest2

  65. object MStrictSimTest3 extends App

    The MStrictSimTest3 object test the MStrictSim class by passing data graph and query graph relative file paths.

    The MStrictSimTest3 object test the MStrictSim class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.MStrictSimTest3

  66. object MTightSimCARTest extends App

    The MTightSimCARTest object is used to test the MTightSimCAR class.

    The MTightSimCARTest object is used to test the MTightSimCAR class. > run-main scalation.graphalytics.mutable.MTightSimCARTest

  67. object MTightSimCARTest2 extends App

    The MTightSimCARTest2 object is used to test the MTightSimCAR class.

    The MTightSimCARTest2 object is used to test the MTightSimCAR class. > run-main scalation.graphalytics.mutable.MTightSimCARTest2

  68. object MTightSimTest extends App

    The MTightSimTest object is used to test the MTightSim class.

    The MTightSimTest object is used to test the MTightSim class. > run-main scalation.graphalytics.mutable.MTightSimTest

  69. object MTightSimTest2 extends App

    The MTightSimTest2 object is used to test the MTightSim class.

    The MTightSimTest2 object is used to test the MTightSim class. > run-main scalation.graphalytics.mutable.MTightSimTest2

  70. object MTightSimTest3 extends App

    The MTightSimTest3 object test the MTightSim class by passing data graph and query graph relative file paths.

    The MTightSimTest3 object test the MTightSim class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.MTightSimTest3

  71. object MinSpanningTreeTest extends App

    The MinSpanningTreeTest object is used to test the MinSpanningTree class.

    The MinSpanningTreeTest object is used to test the MinSpanningTree class. > run-main scalation.graphalytics.mutable.MinSpanningTreeTest

  72. object MinSpanningTreeTest2 extends App

    The MinSpanningTreeTest2 object is used to test the MinSpanningTree class.

    The MinSpanningTreeTest2 object is used to test the MinSpanningTree class.

    See also

    www.cse.ust.hk/~dekai/271/notes/L07/L07.pdf > run-main scalation.graphalytics.mutable.MinSpanningTreeTest2

  73. object MinSpanningTreeTest3 extends App

    The MinSpanningTreeTest3 object is used to test the MinSpanningTree class.

    The MinSpanningTreeTest3 object is used to test the MinSpanningTree 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

  74. object PartitionTest extends App

    The PartitionTest object is used to test the Partition class.

    The PartitionTest object is used to test the Partition class. This test uses random partitioning. > run-main scalation.graphalytics.mutable.PartitionTest

  75. object PartitionTest2 extends App

    The PartitionTest2 object is used to test the Partition class.

    The PartitionTest2 object is used to test the Partition class. This test uses ordered partitioning. > run-main scalation.graphalytics.mutable.PartitionTest2

  76. object PartitionTest3 extends App

    The PartitionTest3 object is used to test the Partition class.

    The PartitionTest3 object is used to test the Partition class. This test uses label propagation for partitioning. > run-main scalation.graphalytics.mutable.PartitionTest3

  77. object Query extends Serializable

    The Query companion object provides methods that work on triples.

  78. object QueryTest extends App

    The QueryTest object is used to test the Query class.

    The QueryTest object is used to test the Query class. It converts a sequence of triples into a graph. > run-main scalation.graphalytics.mutable.QueryTest

  79. object QueryTest2 extends App

    The QueryTest2 object is used to test the Query class.

    The QueryTest2 object is used to test the Query class. It checks if variables or wildcards exist in a triple's labels. > run-main scalation.graphalytics.mutable.QueryTest2

  80. object QueryTest3 extends App

    The QueryTest3 object is used to test the Query class.

    The QueryTest3 object is used to test the Query class. It converts a sequence of triples into a graph. > run-main scalation.graphalytics.mutable.QueryTest3

  81. object SSShortestPath

    The SSShortestPath companion object provides factory methods for the SSShortestPath class.

  82. object SSShortestPathTest extends App

    The SSShortestPathTest object is used to test the SSShortestPath class.

    The SSShortestPathTest object is used to test the SSShortestPath class. Input is in the form of matrices (MatrixD or SparseMatrixD). > run-main scalation.graphalytics.mutable.SSShortestPathTest

  83. object SSShortestPathTest2 extends App

    The SSShortestPathTest2 object is used to test the SSShortestPath class.

    The SSShortestPathTest2 object is used to test the SSShortestPath 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

  84. object SpanningTreeTest extends App

    The SpanningTreeTest object is used to test the SpanningTree class.

    The SpanningTreeTest object is used to test the SpanningTree class. > run-main scalation.graphalytics.mutable.SpanningTreeTest

  85. object StrictSimCARTest extends App

    The StrictSimCARTest object is used to test the StrictSimCAR class.

    The StrictSimCARTest object is used to test the StrictSimCAR class. > run-main scalation.graphalytics.StrictSimCARTest

  86. object StrictSimCARTest2 extends App

    The StrictSimCARTest2 object is used to test the StrictSimCAR class.

    The StrictSimCARTest2 object is used to test the StrictSimCAR class. > run-main scalation.graphalytics.StrictSimCARTest2

  87. object StrictSimTest extends App

    The StrictSimTest object is used to test the StrictSim class.

    The StrictSimTest object is used to test the StrictSim class. > run-main scalation.graphalytics.mutable.StrictSimTest

  88. object StrictSimTest2 extends App

    The StrictSimTest2 object is used to test the StrictSim class.

    The StrictSimTest2 object is used to test the StrictSim class. > run-main scalation.graphalytics.mutable.StrictSimTest2

  89. object StrictSimTest3 extends App

    The StrictSimTest3 object test the StrictSim class by passing data graph and query graph relative file paths.

    The StrictSimTest3 object test the StrictSim class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.StrictSimTest3

  90. object TightSimCARTest extends App

    The TightSimCARTest object is used to test the TightSimCAR class.

    The TightSimCARTest object is used to test the TightSimCAR class. > run-main scalation.graphalytics.mutable.TightSimCARTest

  91. object TightSimCARTest2 extends App

    The TightSimCARTest2 object is used to test the TightSimCAR class.

    The TightSimCARTest2 object is used to test the TightSimCAR class. > run-main scalation.graphalytics.mutable.TightSimCARTest2

  92. object TightSimTest extends App

    The TightSimTest object is used to test the TightSim class.

    The TightSimTest object is used to test the TightSim class. > run-main scalation.graphalytics.mutable.TightSimTest

  93. object TightSimTest2 extends App

    The TightSimTest2 object is used to test the TightSim class.

    The TightSimTest2 object is used to test the TightSim class. > run-main scalation.graphalytics.mutable.TightSimTest2

  94. object TightSimTest3 extends App

    The TightSimTest3 object test the TightSim class by passing data graph and query graph relative file paths.

    The TightSimTest3 object test the TightSim class by passing data graph and query graph relative file paths. > run-main scalation.graphalytics.mutable.TightSimTest3

  95. 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.

  96. object TopSortTest extends App

    The TopSortTest object tests the TopSort object using a directed graph.

    The TopSortTest object tests the TopSort 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

Inherited from AnyRef

Inherited from Any

Ungrouped