com.barrybecker4.discreteoptimization.common.graph.Path.scala Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of bb4-shortest-paths Show documentation

bb4-shortest-paths java code.

The newest version!

package com.barrybecker4.discreteoptimization.common.graph

object Path {
  val EMPTY_PATH: Path = Path(Double.PositiveInfinity, List())
}

case class Path(weight: Double, nodes: List[Int]) {

  /** lazy to avoid computing until needed, and only do it once */
  private lazy val last: Int = nodes.last
  private lazy val nodeSet: Set[Int] = nodes.toSet
  
  def lastNode: Int = last

  private def this(parts: Array[String]) =
    this(parts(0).toDouble, parts.drop(1).map(_.toInt).toList)
    
  /** @param line assumed to be in the form "   ..."
   */
  def this(line: String) = this(line.split("\\s+"))
  
  def containsNode(node: Int): Boolean = nodeSet.contains(node)
  
  override def toString: String = 
    s"$weight ${nodes.mkString(" ")}"
}