Graph model

immutableplaingraph() -> ImmutablePlainGraph
immutableplaingraph(size::Int, edges) -> ImmutablePlainGraph
immutableplaingraph(graph::UndirectedGraph) -> ImmutablePlainGraph

Convert an arbitrary UndirectedGraph into a ImmutablePlainGraph.

ImmutablePlainGraph is same as PlainGraph except for availability of addnode! and addedge!, and no performance difference exists between these graphs. ImmutablePlainGraph is mainly used for unit testing to check adverse effect of some graph algorithm implementations.

plaingraph(nodes, edges) -> PlainGraph{PlainNode,Edge}

Generate vector graph that have given nodes and edges represented by the list of node indices in integer and the list of pairs of node indices, respectively.

plaingraph(graph::OrderedGraph) -> PlainGraph

Convert an arbitrary OrderedGraph into a PlainGraph.

plaingraph(graph::UndirectedGraph) -> PlainGraph

Convert an arbitrary UndirectedGraph into a PlainGraph.

If the given graph has non-sequential indices (ex. subgraph view), node and edge indices are sorted in ascending order and are re-indexed.

plaingraph() -> PlainGraph

Generate empty PlainGraph.

plainhypergraph(size, edges) -> PlainHyperGraph

Generate hyper graph that have given size (number of nodes) and edges (Sets of nodes).

plainhypergraph(graph::HyperGraph) -> PlainHyperGraph

Convert an arbitrary HyperGraph into a PlainHyperGraph.

If the given graph has non-sequential indices (ex. subgraph view), node and edge indices are sorted in ascending order and are re-indexed.

plainhypergraph(graph::OrderedHyperGraph) -> PlainHyperGraph

Convert an arbitrary OrderedHyperGraph into a PlainHyperGraph.

plainhypergraph() -> PlainHyperGraph

Generate empty PlainGraph.

twocoloring(graph::UndirectedGraph)

Do 2-coloring and return two sets of nodes.