use crate::error::{Error, Result};
use crate::game::{PlayerSet, SetFunction};
use crate::properties::{ConvexGame, Proven};
#[derive(Clone, Debug, PartialEq)]
pub struct InducedSubgraphGame {
players: usize,
edges: Vec<(usize, usize, f64)>,
}
impl InducedSubgraphGame {
pub fn new(players: usize, edges: Vec<(usize, usize, f64)>) -> Result<InducedSubgraphGame> {
if players == 0 {
return Err(Error::InvalidArgument("プレイヤーがいない".into()));
}
for &(u, v, w) in &edges {
if u >= players || v >= players || u == v {
return Err(Error::InvalidArgument(format!("辺 ({u}, {v}) が不正")));
}
if !(w.is_finite() && w >= 0.0) {
return Err(Error::InvalidArgument(format!(
"辺 ({u}, {v}) の重み {w} が非負の有限値でない"
)));
}
}
Ok(InducedSubgraphGame { players, edges })
}
pub fn edges(&self) -> &[(usize, usize, f64)] {
&self.edges
}
}
impl SetFunction for InducedSubgraphGame {
fn players(&self) -> usize {
self.players
}
fn value(&self, coalition: &PlayerSet) -> f64 {
self.edges
.iter()
.filter(|(u, v, _)| coalition.contains(*u) && coalition.contains(*v))
.map(|(_, _, w)| w)
.sum()
}
}
impl ConvexGame for InducedSubgraphGame {
type Proof = Proven;
}