graphrs 0.11.16

graphrs is a Rust package for the creation, manipulation and analysis of graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

use crate::{Edge, Graph, GraphSpecs, MissingNodeStrategy};
use itertools::Itertools;
use std::sync::Arc;

/**
Generates a "complete" graph: one where every node is connected to every other node.

# Arguments

* `num_nodes`: The number of nodes to generate.
* `directed`: `true` for a directed graph, `false` for an undirected graph

# Examples

```
use graphrs::{generators};
let graph = generators::classic::complete_graph(5, true);
```
*/
pub fn complete_graph(num_nodes: i32, directed: bool) -> Graph<i32, ()> {
    let x = match directed {
        false => (0..num_nodes).combinations(2).collect::<Vec<Vec<i32>>>(),
        true => (0..num_nodes).permutations(2).collect::<Vec<Vec<i32>>>(),
    };
    let nodes = vec![];
    let edges = x
        .into_iter()
        .map(|x| Edge::new(x[0], x[1]))
        .collect::<Vec<Arc<Edge<i32, ()>>>>();
    let specs = match directed {
        false => GraphSpecs {
            missing_node_strategy: MissingNodeStrategy::Create,
            ..GraphSpecs::undirected()
        },
        true => GraphSpecs {
            missing_node_strategy: MissingNodeStrategy::Create,
            ..GraphSpecs::directed()
        },
    };
    Graph::new_from_nodes_and_edges(nodes, edges, specs).unwrap()
}