diff --git a/tex/container_interface.tex b/tex/container_interface.tex index 1e787cb..b5fac4d 100644 --- a/tex/container_interface.tex +++ b/tex/container_interface.tex @@ -22,8 +22,9 @@ \section{Concepts} \tcode{vertex_range} & \tcode{vertices(g)} returns a sized, forward\_range; \tcode{vertex_id(g,ui)} exists\\ \tcode{targeted_edge} & \tcode{target_id(g,uv)} and \tcode{target(g,uv)} exist\\ \tcode{sourced_edge} & \tcode{source_id(g,uv)} and \tcode{source(g,uv)} exist\\ - \tcode{adjacency_list} & \tcode{vertex_range} and \tcode{targeted_edge>} and \tcode{edges(g,_)} functions return a forward\_range\\ - \tcode{sourced_adjacency_list} & \tcode{adjacency_list} and \tcode{sourced_edge>} and \tcode{edge_id(g,uv)} exists \\ + \tcode{index_adjacency_list} & \tcode{vertex_range} and \tcode{targeted_edge>} and \tcode{edges(g,uid)} functions return a forward\_range\\ + \tcode{adjacency_list} & Extends \tcode{index_adjacency_list} by adding \tcode{edges(g,u)} that returns a forward\_range\\ + \tcode{sourced_adjacency_list} & \tcode{adjacency_list} and \tcode{sourced_edge>} and \tcode{edge_id(g,uv)} exists \\ \hline \tcode{copyable_vertex} & \tcode{convertible_to>} \\ \tcode{copyable_edge} & \tcode{convertible_to>} \\ @@ -145,7 +146,7 @@ \section{Functions} \hline \tcode{graph_value(g)} & \tcode{graph_value_t} & constant & n/a, optional \\ \hdashline - \tcode{partition_count(g)} & \tcode{vertex_id_t} & constant & \tcode{1}. Minimum value is 1. \\ + \tcode{partition_count(g)} & \tcode{vertex_id_t} & constant & Minimum value is 1. \\ \hline \tcode{vertices(g)} & \tcode{vetex_range_t} & constant & n/a \\ \tcode{num_vertices(g)} & \tcode{integral} & constant & \tcode{size(vertices(g))} \\ diff --git a/tex/views.tex b/tex/views.tex index 4e9d575..d6b4395 100644 --- a/tex/views.tex +++ b/tex/views.tex @@ -223,6 +223,10 @@ \section{vertexlist Views} \tcode{for(auto\&\& [uid,u,val] : vertexlist(g,first,last,vvf))} & \tcode{vertex_view} \\ \tcode{for(auto\&\& [uid,u] : vertexlist(g,vr))} & \tcode{vertex_view} \\ \tcode{for(auto\&\& [uid,u,val] : vertexlist(g,vr,vvf))} & \tcode{vertex_view} \\ +\hdashline + \tcode{for(auto\&\& [uid] : basic_vertexlist(g))} & \tcode{vertex_view} \\ + \tcode{for(auto\&\& [uid] : basic_vertexlist(g,first,last))} & \tcode{vertex_view} \\ + \tcode{for(auto\&\& [uid] : basic_vertexlist(g,vr))} & \tcode{vertex_view} \\ \hline \end{tabular}} \caption{\tcode{vertexlist} View Functions} @@ -243,8 +247,10 @@ \section{incidence Views} \hline \textbf{Example} & \textbf{Return} \\ \hline - \tcode{for(auto\&\& [vid,uv] : incidence(g,u))} & \tcode{edge_view} \\ - \tcode{for(auto\&\& [vid,uv,val] : incidence(g,u,evf))} & \tcode{edge_view} \\ + \tcode{for(auto\&\& [vid,uv] : incidence(g,uid))} & \tcode{edge_view} \\ + \tcode{for(auto\&\& [vid,uv,val] : incidence(g,uid,evf))} & \tcode{edge_view} \\ +\hdashline + \tcode{for(auto\&\& [vid] : basic_incidence(g,uid))} & \tcode{edge_view} \\ \hline \end{tabular}} \caption{\tcode{incidence} View Functions} @@ -265,8 +271,10 @@ \section{neighbors Views} \hline \textbf{Example} & \textbf{Return} \\ \hline - \tcode{for(auto\&\& [vid,v] : neighbors(g,u))} & \tcode{neighbor_view} \\ - \tcode{for(auto\&\& [vid,v,val] : neighbors(g,u,vvf))} & \tcode{neighbor_view} \\ + \tcode{for(auto\&\& [vid,v] : neighbors(g,uid))} & \tcode{neighbor_view} \\ + \tcode{for(auto\&\& [vid,v,val] : neighbors(g,uid,vvf))} & \tcode{neighbor_view} \\ +\hdashline + \tcode{for(auto\&\& [vid] : basic_neighbors(g,uid))} & \tcode{neighbor_view} \\ \hline \end{tabular}} \caption{\tcode{neighbors} View Functions} @@ -287,6 +295,8 @@ \section{edgelist Views} \hline \tcode{for(auto\&\& [uid,vid,uv] : edgelist(g))} & \tcode{edge_view} \\ \tcode{for(auto\&\& [uid,vid,uv,val] : edgelist(g,evf))} & \tcode{edge_view} \\ +\hdashline + \tcode{for(auto\&\& [uid,vid] : basic_edgelist(g))} & \tcode{edge_view} \\ \hline \end{tabular}} \caption{\tcode{edgelist} View Functions}