//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
/** @author  Aravind Kalimurthy, John Miller
 *  @version 1.4
 *  @date    Tue Jan 24 09:13:15 EDT 2017
 *  @see     LICENSE (MIT style license file).
 */

package scalation.graph_db
package pattern_matching
package test

import scalation.graphalytics.{GraphSim => ImGraphSim, GraphSim2 => ImGraphSim2}
import scalation.graph_db.{ExampleMGraphS => EX_GRAPH}
import scalation.util.banner

//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
/** The `GraphPattern_STest` object is used to test all the Graph Simulation pattern
 *  matchers for labels of type `String`.
 *  > runMain scalation.graph_db.pattern_matching.test.GraphPattern_STest
 */
object GraphPattern_STest extends App
{
    val g2  = EX_GRAPH.g2p
    val q2  = EX_GRAPH.q2p

    val g3  = EX_GRAPH.g3p
    val q3  = EX_GRAPH.q3p

    val g4  = EX_GRAPH.g4p                                      // query graph
    val q4w = EX_GRAPH.q4wp                                     // query graph with wildcards
    val q4x = EX_GRAPH.q4xp                                     // query graph with regex

    println (s"g2.checkEdges = ${g2.checkEdges}")
    q4w.printG ()
    q4x.printG ()
    println (s"q2.checkEdges = ${q2.checkEdges}")
    g4.printG ()

    // Answers.convert (new MGraphSim (g4, q4).test ("MGraphSim", Answers_g2.phi5W))    // MGraph Simulation W on q4W Wildcards

    // Graph Simulation Pattern Matcher

    (new GraphSim (g2, q2)).test ("GraphSim", Answers_g2.phi1)            // Graph Simulation
    (new GraphSim2 (g2, q2)).test ("GraphSim2", Answers_g2.phi1)          // Graph Simulation 2
    (new GraphSimCAR (g2, q2)).test ("GraphSimCAR", Answers_g2.phi2)      // Graph Simulation CAR

    // MGraph Simulation Pattern Matcher

    (new MGraphSim (g2, q2)).test ("MGraphSim", Answers_g2.phi1)          // MGraph Simulation
    (new MGraphSimW (g2, q2)).test ("MGraphSimW", Answers_g2.phi1)        // MGraph Simulation W on q2
    (new MGraphSimW (g4, q4w)).test ("MGraphSimW", Answers_g2.phi1)       // MGraph Simulation W on q4 Wildcards on EdgeLabels
    (new MGraphSimX (g4, q4x)).test ("MGraphSimX", Answers_g2.phi1)       // MGraph Simulation X on q5 Regex on EdgeLabels
    (new MGraphSim2 (g2, q2)).test ("MGraphSim2", Answers_g2.phi1)        // MGraph Simulation 2
    (new MGraphSim2W (g2, q2)).test ("MGraphSim2W", Answers_g2.phi1)      // MGraph Simulation 2 W on q2
    (new MGraphSim2W (g4, q4w)).test ("MGraphSim2W", Answers_g2.phi1)     // MGraph Simulation 2 W on q4 Wildcards on EdgeLabels
    (new MGraphSim2X (g4, q4x)).test ("MGraphSim2X", Answers_g2.phi1)     // MGraph Simulation 2 X on q5 Regex on EdgeLabels
    (new MGraphSimCAR (g2, q2)).test ("MGraphSimCAR", Answers_g2.phi2)    // MGraph Simulation CAR

    // MGraph Simulation Pattern Matcher- checks mismatched edge labels

    (new MGraphSim (g3, q3)).test ("MGraphSim", Answers_g3.phi3)          // MGraph Simulation
    (new MGraphSimW (g3, q3)).test ("MGraphSimW", Answers_g3.phi3)        // MGraph Simulation W on q3
    (new MGraphSimX (g3, q3)).test ("MGraphSimX", Answers_g3.phi3)        // MGraph Simulation Rx on q5 Regex
    (new MGraphSim2 (g3, q3)).test ("MGraphSim2", Answers_g3.phi3)        // MGraph Simulation 2
    (new MGraphSim2W (g3, q3)).test ("MGraphSim2W", Answers_g3.phi3)      // MGraph Simulation 2 W on q3
    (new MGraphSim2X (g3, q3)).test ("MGraphSim2X", Answers_g3.phi3)      // MGraph Simulation 2 Rx on q5 Regex
    (new MGraphSimCAR (g3, q3)).test ("MGraphSimCAR", Answers_g3.phi4)    // MGraph Simulation CAR

} // GraphPattern_STest object


//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
/** The `GraphPattern_STest2` object is used to test all the Graph Simulation pattern
 *  matchers for labels of type `String` for randomly generated graphs.
 *  > runMain scalation.graph_db.pattern_matching.test.GraphPattern_STest2
 */
object GraphPattern_STest2 extends App
{
    val UNIFORM = true                                                      // uniform vs. power law
    val gLabels = 10                                                        // number of labels in g
    val gDegree = 20                                                        // average out-degree for g
    val qSize   = 10                                                        // number of vertices in g
    val qDegree = 2                                                         // average out-degree for q
    val inverse = true                                                      // include links to parents

    for (gSize <- 1000 to 5000 by 1000) {                                   // number of vertices in g

//      val stream  = 11                                                    // random number stream 0 to 999
        for (stream <- 0 until 5) {
            val rg = new GraphGen ("0", stream)                             // random graph generator
            val g  = if (UNIFORM) rg.genRandomConnectedGraph (gSize, gLabels, gDegree)
                     else rg.genPowerLawGraph (gSize, gLabels, gDegree)     // data graph g
            banner ("data graph")
//          g.printG ()
            println (GraphMetrics.stats (g))

            val q  = rg.genBFSQuery (qSize, qDegree, g, inverse, "q")       // query graph q
            banner ("query graph")
            q.printG ()
            println (GraphMetrics.stats (q))

            // Graph Simulation Pattern Matcher

            (new GraphSim (g, q)).test ("GraphSim")                         // Graph Simulation
            (new GraphSim2 (g, q)).test ("GraphSim2")                       // Graph Simulation 2
            (new GraphSimCAR (g, q)).test ("GraphSimCAR")                   // Graph Simulation CAR
        } // for
    } // for

} // GraphPattern_STest2 object


//::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
/** The `GraphPattern_STest3` object is used to test all the Graph Simulation pattern
 *  matchers for labels of type `String` for randomly generated graphs.
 *  > runMain scalation.graph_db.pattern_matching.test.GraphPattern_STest3
 */
object GraphPattern_STest3 extends App
{
    val UNIFORM = true                                                      // uniform vs. power law
    val gLabels = 10                                                        // number of labels in g
    val gDegree = 20                                                        // average out-degree for g
    val qSize   = 10                                                        // number of vertices in g
    val qDegree = 2                                                         // average out-degree for q
    val inverse = true                                                      // include links to parents

    for (gSize <- 1000 to 5000 by 1000) {                                   // number of vertices in g

//      val stream  = 11                                                    // random number stream 0 to 999
        for (stream <- 0 until 5) {
            val rg = new GraphGen ("0", stream)                             // random graph generator
            val g  = if (UNIFORM) rg.genRandomConnectedGraph (gSize, gLabels, gDegree)
                     else rg.genPowerLawGraph (gSize, gLabels, gDegree)     // data graph g
            banner ("data graph")
//          g.printG ()
            println (GraphMetrics.stats (g))

            val q  = rg.genBFSQuery (qSize, qDegree, g, inverse, "q")       // query graph q
            banner ("query graph")
            q.printG ()
            println (GraphMetrics.stats (q))

            val gSIM = g.toGraphIm ("gSIM")
            val qSIM = q.toGraphIm ("gSIM")

            // Immutable Graph Simulation Pattern Matcher

            (new ImGraphSim (gSIM, qSIM)).test ("GraphSim")                   // Graph Simulation
            (new ImGraphSim2 (gSIM, qSIM)).test ("GraphSim2")                 // Graph Simulation 2
        } // for
    } // for

} // GraphPattern_STest3 object