Did you know ... Search Documentation:
Pack wgraph -- prolog/wgraph.pl
PublicShow source

For now the emphasis is on plotting via igraph, qgraph and ggnet2, R libraries via Real.

A weighted graphs is represented as a list of From-To:W edges or Node entries for orphans.

See wgraph_plot/2.

- nicos angelopoulos
- 0.1 2015/6/12
- 0:2 2016/1/23
- 0.3 2017/3/12
- 0.4 2019/4/21
- 0.5 2019/5/8
- 0.6 2019/5/12
 wgraph_version(-Version, -Date)
Version (Mj:Mn:Fx) and Date of publication (date(Y,M,D)).
 ?- wgraph_version( V, D ).
 V = 0:6:0
 D = date(2019,5,12)

Undocumented predicates

The following predicates are exported, but not or incorrectly documented.

 wgraph(Arg1, Arg2)
 wgraph(Arg1, Arg2, Arg3)
 wgraph_add_edges(Arg1, Arg2, Arg3)
 wgraph_add_vertices(Arg1, Arg2, Arg3)
 wgraph_adjacency(Arg1, Arg2)
 wgraph_adjacency(Arg1, Arg2, Arg3)
 wgraph_clique(Arg1, Arg2)
 wgraph_clique(Arg1, Arg2, Arg3, Arg4)
 wgraph_known_cliques_replace(Arg1, Arg2, Arg3, Arg4)
 wgraph_vertices(Arg1, Arg2)
 wgraph_plot(Arg1, Arg2)
 wgraph_ugraph(Arg1, Arg2)