Class Hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

ibmppl::_edge_iterator_t< base_type, base_vertex_iterator, graph_type >	Edge iterator type
ibmppl::_fast_vertex_iterator< Graph, VIT >	Fast vertex iterator type
ibmppl::_subproperty_iterator_t< vertex_iterator, edge_iterator >	Property(subproperty) iterator type
ibmppl::_vertex_iterator_t< base_type, edge_iterator, graph_type >	Vertex iterator type
ibmppl::adj_list_persistent_rdf_traits< VP, EP, Directedness >
ibmppl::adj_list_rdf_traits< VP, EP, Directedness >
ibmppl::adj_list_vector_storage_traits< VP, EP, Directedness >	Traits describes basic types and storage types used in representing the graph
ibmppl::adjacency_list< Traits >	Adjaceny list class. The main functionality of a directed graph is implemented here. It uses Traits as a template argument from which it infers all teh types used by the graph
ibmppl::DAdaptor< DIRECTED, Traits >	Adaptor to specialize add/delete edge for an directed graph. An empty class as all required functionality is already provided by the adjacency_list base class;
ibmppl::DAdaptor< PRED_DIRECTED, Traits >	Directed graph where each vertex stores both incoming and outgoing edges
ibmppl::DAdaptor< UNDIRECTED, Traits >	Adaptor to specialize add/delete edge for an undirected graph. It derives from the base adjacency_list class and add un undirected edge as a bidirectional edge. Fro example an undirected edge between a source S and a destintation D implies the storage will have an edge from S->D and an edge from D->S
analytic_auction	Auction algorithm for find match in weighted bipartited graph
analytic_bfs	GShell command - breath-first search from a given vertex
analytic_colfilter	GShell command - collaborative filter to get vertices similar to the given vertex
analytic_engine_betweenness_centrality	Compute the betweenness centrality at the vertex level
analytic_engine_closeness_centrality	Compute the closeness centrality at the vertex level
analytic_engine_clustering_coefficient	Compute the local clustering coefficient at the vertex level
analytic_engine_connected_component	Compute the connected components of the graph
analytic_engine_degree_centrality	Compute the degree of each vertex
analytic_engine_egonet	Compute the egonet of a given vertex (ego)
analytic_engine_find_path	Find a shortest path (edge weight ignored) between vertices
analytic_engine_k_core	Compute the k-core of the graph
analytic_engine_k_shortest_paths	Compute the top k shortest paths between a source vertex and a sink vertex
analytic_engine_reset	Reset analytic engine for a graph (to rerun the same analytic on this graph)
analytic_engine_shortest_paths	Compute the shortest paths between vertices
analytic_engine_start	Start analytic engine for a graph to initialize in-memory data structures used by the analytics
analytic_engine_stop	Stop analytic engine for a graph to clear in-memory data structures
analytic_engine_triangle_count	Compute the number of triangles at the vertex level
analytic_pagerank	Compute page rank within gShell. This implementaion is adapted from the 2nd page rank algorithm on wiki pagerank, the Matlab description of which is given below. Note that in our adaption, we do not use matrices, but mapped all operations onto graph elements. This plug-in allows uer to specify a vertex subproperty (optional), where we can load/save the page ranks. This plugin is memory-demanding for large scale graphs, since it allocates variables for each vertex and each edge. This plug-in only works for directed graph
arena< N >
ibmppl::batch_mode_storage< ibmppl::inDiskRDFVertex< VProperty, Edgelist, Base >, VProperty, EProperty, db_type, PRED_DIRECTED >
ibmppl::computation< TID >	Class used to track information about an individual computation; A computation consists of a set of task and here for example we can monitor how many are finished; How many are left; Is the computation done ?
ibmppl::computation< task_id >
ibmppl::internal::const_random_access_iterator< BASE_ITERATOR >
ibmppl::d_twod_array< T >
ibmppl::EdgeBase	Base class for graph edge with an id, a source and a sink
ibmppl::Edge< Data, Directedness >
ibmppl::Edge< Data, UNDIRECTED >
ibmppl::Edge< Property, Directedness >	Generic implementation of graph edge templated by Property type
ibmppl::Edge< Property, UNDIRECTED >	Specialization for Edge for undirected graphs Undirected graph stores two edges between a pair of vertices, where both edges share the same property
ibmppl::for_each_wf< DS, Func, hasReducer >	Work function class
ibmppl::for_each_wf2< DS1, DS2, Func, hasReducer >	Work function class for two container classes 1) w/ the same # partitions and 2) same elements per partition where
ibmppl::Graph< VProperty, EProperty, Directedness, Traits >	The main graph class to be instantiated by users
ibmppl::Graph< neo4j_vertex< int32_t >, neo4j_relation< int32_t >, DIRECTED, neo4j_traits >
ibmppl::Graph< vertex_property_path, edge_property_path, ibmppl::PRED_DIRECTED >
ibmppl::Graph< VProperty, EProperty, Directness, adj_list_indisk_storage_traits< VProperty, EProperty, Directness > >
ibmppl::Graph< VProperty, EProperty, Directness, adj_list_indisk_storage_traits< VProperty, EProperty, PRED_DIRECTED > >
ibmppl::Graph< VProperty, EProperty, Directness, mv_indisk_storage_traits< VProperty, EProperty, Directness > >
ibmppl::Graph< VProperty, EProperty, Directness, Traits >
ibmppl::graph_config
ibmppl::graph_vertex_iterator< G >	Adaptor class to implement the ::begin() and ::end() interface for linear partitioner for graph
gShell_t	GShell class - provide CLI for querying graph store and invoking graph analytics
gShellSuperMgr_t	Graph sharing management We use a graph to manage graph sharing if (v->u) E, user v shares data to user u (v, u).share_graph gives a string of all graph names v sharing to u
ibmppl::imp_graphelement_iterator< GraphElement, BaseIterator, Graph, IdType >	Buffers all modifications to the properties until the user triggers the commit
ibmppl::imp_graphelement_iterator< Edge, BaseEdgeIterator, Graph, IdType >
ibmppl::imp_edge_iterator< Edge, BaseEdgeIterator, Graph, IdType >
ibmppl::imp_graphelement_iterator< edge_type, base_edge_iterator, this_type, edged_type >
ibmppl::imp_edge_iterator< edge_type, base_edge_iterator, this_type, edged_type >
ibmppl::imp_graphelement_iterator< Vertex, BaseIterator, Graph, IdType >
ibmppl::imp_vertex_iterator< Vertex, BaseIterator, Graph, IdType >
ibmppl::imp_pred_iterator< GraphElement, BaseIterator, Graph >
indexer_clucene	External indexer of CLucene for native store
ibmppl::inDisk_Vertex< Data, EdgeList, Directedness, Base >	Vertex for a large graph where only part of the graph fits into the memory
ibmppl::inDisk_Vertex< Data, EdgeList, Directness, Base >
ibmppl::inDisk_Vertex< Data, EdgeList, PRED_DIRECTED, Base >
ibmppl::label_tool< tabular_multiproperty_type >
ibmppl::linear_task_partitioner< T >	Implement block-based linear partitioning for container class T
ibmppl::linear_task_partitioner< graph_vertex_iterator< G > >
ibmppl::graph_linear_task_partitioner< G >	A wrapper for implementing a linear partition of vertices on graphs
ibmppl::internal::list_storage< T >
ibmppl::mp_subproperty_iterator_t< vertex_iterator, edge_iterator >	Property(subproperty) iterator type
ibmppl::omnidirectional_edge_iterator_t< base_type, base_vertex_iterator, graph_type >	Omnidirectional edge iterator
query_add_edge	GShell command - add an edge
query_add_vertex	GShell command - add a vertex
query_del_edge	Erase edge in gShell
query_del_vertex	Erase vertex in gShell
query_delete_eprop	GShell command - delete property/ies of an edge
query_delete_vprop	GShell command - delete property/ies of a vertex
query_export_csv	GShell command - dump a graph into a set of CSV files
query_filter_edges	GShell command - filter edges according to the property values or labels
query_filter_vertices	GShell command - filter vertices according to property values or labels
query_find_edge	GShell command - get information of an edge
query_find_multiple_vertex	GShell command - get information of a list of vertices
query_find_neighbors	GShell command - find neighbors given a vertex or a set of vertices
query_find_random_edges	GShell command - randomly find a set of edges (may include duplicates)
query_find_random_vertices	GShell command - randomly find a set of vertices (may include duplicates)
query_find_vertex	GShell command - get information of a vertex or a set of vertices
query_find_vertex_max_degree	GShell command - find a vertex with the maximum degree in a graph
query_get_egonet	GShell command - get the k-hop egonet of a vertex
query_get_num_edges	GShell command - get the number of edges in a graph
query_get_num_vertices	GShell command - get the number of vertices in a graph
query_get_subgraph	GShell command - get the induced subgraph of a graph given a list of vertices
query_get_vertex_degree	GShell command - get the vertex degree
query_load_csv_edges	GShell command - load edges from a CSV file
query_load_csv_vertices	GShell command - load vertices from a CSV file
query_print_all	Print entire graph in gShell
query_set_max_mem	GShell command - set the maximum memory footprint
query_span_graph	GShell command - span a graph from a subset of vertices (same functionality can provided by get_subgraph together with print_all)
query_update_edge	GShell command - update an edge
query_update_vertex	GShell command - update a vertex
ibmppl::internal::random_access_iterator< BASE_ITERATOR >
ibmppl::rdfGraph< VProperty, EProperty, ST >
ibmppl::rdfGraph< tabular_multiproperty_type, tabular_multiproperty_type, ST >
ibmppl::ibm_multiproperty_graph_generic< HYBRID >
ibmppl::ibm_generic_graph	Generic Graph Class: a generic interface for directed/undirected graph
ibmppl::ibm_multiproperty_graph_generic< ST >	IBM Multi property graph class to store multiple properties
socket_client_type	Socket_client class
socket_server_type	Socket_server class
ibmppl::internal::target_is_not< Edge >	Functor used with find edge when looking for a particular target
ibmppl::internal::task_allocator< T >	Task allocator. This class maintains a pool of tasks with methods to allocate and free tasks
ibmppl::internal::task_graph_traits	The task graph employed by the scheduler is an instatiation of the Graph class; These are the corresponding traits
ibmppl::internal::task_manager< T >	Task manager for the runtime. It maintains a task allocator per thread
ibmppl::internal::task_manager< internal::ibmppl::internal::task >
ibmppl::internal::task_manager< internal::task >
ibmppl::internal::task_queue< T >	Simple thread safe queue for task management;
ibmppl::threadsafe_graph_add_edge_adaptor< G, directness, profile >	Adaptor to implement thread-safe update functions of a graph
ibmppl::threadsafe_graph_add_edge_adaptor< G, UNDIRECTED, profile >
userinfo_t	Store user information
ibmppl::internal::vector_storage< T >
ibmppl::VertexBase< Property, EdgeList >	Base vertex class with a list of edges and a vertex property
ibmppl::RDFVertex< Property, EdgeList, Directedness >
ibmppl::Vertex< Property, EdgeList, Directedness >	Generic implementation of graph vertex class w/ a list of edges and a vertex property
ibmppl::Vertex< Property, EdgeList, PRED_DIRECTED >	Specialized Vertex for directed graph w/ predecessor list
ibmppl::VertexBase< int, std::vector< Edge< int, DIRECTED > > >
ibmppl::Vertex< int, std::vector< Edge< int, DIRECTED > >, DIRECTED >
ibmppl::internal::task	Task consisting of data and workfunction; This is a vertex of a task dependency graph;
ibmppl::work_function	Base work function; all others should derive from it
ibmppl::for_each_wf2< DS1, DS2, Func, false >	Specialization of for_each_wf2 w/o reducer
ibmppl::for_each_wf2< DS1, DS2, Func, true >	Specialization of for_each_wf2 w/ reducer
ibmppl::for_each_wf< DS, Func, false >	Work function specialization of for_each_wf2 w/o reducer
ibmppl::for_each_wf< DS, Func, true >	Specialization of for_each_wf2 w/ reducer