Checks if an undirected graph is bipartite and finds the bipartite partitions.
Arguments
- arcSources
Vector corresponding to the source nodes of a graph's edges
- arcTargets
Vector corresponding to the destination nodes of a graph's edges
- numNodes
The number of nodes in the graph
Value
A named list containing 1) "is_bipartite": a logical stating
if the graph is bipartite, and 2) "partitions": A vector of length
numNodes, containing the partition for each node
Details
See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#ga58ba1d00c569f0eb0deb42afca9f80bb for more information.