2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 04:12:11 +00:00
Files
graph/example/undirected_adjacency_list.expected
Jeremiah Willcock 22b521ecf4 Merged Boost.Graph changes from trunk for 1.53
[SVN r82061]
2012-12-17 23:59:46 +00:00

10 lines
249 B
Plaintext

out_edges(0): (0,1) (0,2)
in_edges(0): (1,0) (2,0)
in a directed graph is (u,v) == (v,u) ? 0
weight[(u,v)] = 1.2
weight[(v,u)] = 2.4
in an undirected graph is (u,v) == (v,u) ? 1
weight[(u,v)] = 3.1
weight[(v,u)] = 3.1
the edges incident to v: (0,1)