Visible to Intel only — GUID: GUID-9D8E87EF-2377-4DCA-9225-337A77641500
basic_statistics_dense_batch.cpp
column_accessor_homogen.cpp
cor_dense_batch.cpp
cov_dense_batch.cpp
dbscan_brute_force_batch.cpp
df_cls_hist_batch.cpp
df_cls_hist_batch_random.cpp
df_cls_traverse_model.cpp
df_reg_hist_batch.cpp
df_reg_hist_batch_random.cpp
df_reg_traverse_model.cpp
kmeans_init_dense.cpp
kmeans_lloyd_dense_batch.cpp
knn_cls_brute_force_dense_batch.cpp
knn_reg_brute_force_dense_batch.cpp
knn_search_brute_force_dense_batch.cpp
linear_kernel_dense_batch.cpp
linear_regression_dense_batch.cpp
pca_cor_dense_batch.cpp
pca_precomputed_cor_dense_batch.cpp
pca_precomputed_cov_dense_batch.cpp
rbf_kernel_dense_batch.cpp
svm_two_class_thunder_dense_batch.cpp
basic_statistics_dense_batch.cpp
column_accessor_homogen.cpp
connected_components_batch.cpp
cor_dense_batch.cpp
cov_dense_batch.cpp
csr_accessor.cpp
dbscan_brute_force_batch.cpp
df_cls_dense_batch.cpp
df_reg_dense_batch.cpp
directed_graph.cpp
graph_service_functions.cpp
jaccard_batch.cpp
jaccard_batch_app.cpp
kmeans_init_dense.cpp
kmeans_lloyd_dense_batch.cpp
knn_cls_brute_force_dense_batch.cpp
knn_cls_kd_tree_dense_batch.cpp
knn_search_brute_force_dense_batch.cpp
linear_kernel_dense_batch.cpp
linear_regression_dense_batch.cpp
logloss_dense_batch.cpp
louvain_batch.cpp
pca_dense_batch.cpp
pca_precomputed_dense_batch.cpp
polynomial_kernel_dense_batch.cpp
rbf_kernel_dense_batch.cpp
shortest_paths_batch.cpp
sigmoid_kernel_dense_batch.cpp
subgraph_isomorphism_batch.cpp
svm_multi_class_thunder_csr_batch.cpp
svm_multi_class_thunder_dense_batch.cpp
svm_nu_cls_thunder_csr_batch.cpp
svm_nu_cls_thunder_dense_batch.cpp
svm_nu_reg_thunder_csr_batch.cpp
svm_nu_reg_thunder_dense_batch.cpp
svm_reg_thunder_csr_batch.cpp
svm_reg_thunder_dense_batch.cpp
svm_two_class_smo_csr_batch.cpp
svm_two_class_smo_dense_batch.cpp
svm_two_class_thunder_csr_batch.cpp
svm_two_class_thunder_dense_batch.cpp
triangle_counting_batch.cpp
Mathematical Notations
Mathematical Notations
Correlation and Variance-Covariance Matrices
Mathematical Notations
Principal Components Analysis Transform
Singular Value Decomposition
Association Rules
Mathematical Notations
Mathematical Notations
Cholesky Decomposition
QR Decomposition
Outlier Detection
Distance Matrix
Distributions
Engines
Moments of Low Order
Mathematical Notations
Quality Metrics
Sorting
Normalization
Mathematical Notations
Visible to Intel only — GUID: GUID-9D8E87EF-2377-4DCA-9225-337A77641500
directed_graph.cpp
/*******************************************************************************
* Copyright 2020 Intel Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*******************************************************************************/
#include <iostream>
#include "example_util/utils.hpp"
#include "oneapi/dal/graph/service_functions.hpp"
#include "oneapi/dal/graph/directed_adjacency_vector_graph.hpp"
#include "oneapi/dal/io/csv.hpp"
using namespace std;
namespace dal = oneapi::dal;
int main(int argc, char** argv) {
const auto filename = get_data_path("weighted_edge_list.csv");
using vertex_type = int32_t;
using weight_type = double;
using graph_t = dal::preview::directed_adjacency_vector_graph<vertex_type, weight_type>;
const auto graph = dal::read<graph_t>(dal::csv::data_source{ filename },
dal::preview::read_mode::weighted_edge_list);
std::cout << "Number of vertices: " << dal::preview::get_vertex_count(graph) << std::endl;
std::cout << "Number of edges: " << dal::preview::get_edge_count(graph) << std::endl;
dal::preview::vertex_outward_edge_size_type<graph_t> vertex_id = 0;
std::cout << "Degree of " << vertex_id << ": "
<< dal::preview::get_vertex_outward_degree(graph, vertex_id) << std::endl;
for (dal::preview::vertex_outward_edge_size_type<graph_t> j = 0;
j < dal::preview::get_vertex_count(graph);
++j) {
std::cout << "Neighbors of " << j << ": ";
const auto neigh = dal::preview::get_vertex_outward_neighbors(graph, j);
for (auto i = neigh.first; i != neigh.second; ++i) {
std::cout << *i << "-" << dal::preview::get_edge_value(graph, j, *i) << " ";
}
std::cout << std::endl;
}
return 0;
}