Bundle edges in a bipartite graph
edge_bundle_bipartite(g, type = "nodeType", ...)igraph object
character name of vertex attribute that defines the
node type.
additional arguments are ignored.
This function performs edge bundling in bipartite network graphs, which are expected to contain two classes of nodes. In general this situation lends itself well to bundling edges by shared connections, where a subset of nodes of one class all bind to the same set of nodes in the other class. These nodes are typically co-located in the network layout, which works well with this style of edge bundling.
Other jam igraph functions:
cnet2df(),
cnet2im(),
cnetplotJam(),
cnetplot_internalJam(),
color_edges_by_nodegroups(),
color_edges_by_nodes_deprecated(),
color_edges_by_nodes(),
color_nodes_by_nodegroups(),
communities2nodegroups(),
drawEllipse(),
edge_bundle_nodegroups(),
enrichMapJam(),
fixSetLabels(),
flip_edges(),
get_bipartite_nodeset(),
igraph2pieGraph(),
jam_igraph(),
jam_plot_igraph(),
label_communities(),
layout_with_qfrf(),
layout_with_qfr(),
mem2emap(),
memIM2cnet(),
mem_multienrichplot(),
nodegroups2communities(),
rectifyPiegraph(),
relayout_with_qfr(),
removeIgraphBlanks(),
removeIgraphSinglets(),
reorderIgraphNodes(),
rotate_igraph_layout(),
spread_igraph_labels(),
subgraph_jam(),
subsetCnetIgraph(),
subset_igraph_components(),
sync_igraph_communities(),
with_qfr()