repo_id stringlengths 21 96 | file_path stringlengths 31 155 | content stringlengths 1 92.9M | __index_level_0__ int64 0 0 |
|---|---|---|---|
rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm/libShape/Linear.h | /**
* Linear.h: a set of linear shape functions
* DG++
*
* Created by Adrian Lew on 9/4/06.
*
* Copyright (c) 2006 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software wi... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm/libShape/Shape.h | /**
* Shape.h
* DG++
*
* Created by Adrian Lew on 9/4/06.
*
* Copyright (c) 2006 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* w... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm/libShape | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libElm/libShape/test/testLinear.cpp | /*
* testLinear.cpp
* DG++
*
* Created by Adrian Lew on 9/9/06.
*
* Copyright (c) 2006 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps/avi | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libAVI/StandardAVI.cpp | /*
* AVI.h
* DG++
*
* Created by Mark Potts on 3/25/09.
*
* Copyright (c) 2009 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* wit... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps/avi | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libAVI/AVI.h | /**
* AVI.h
* DG++
*
* Created by Adrian Lew on 9/23/08.
*
* Copyright (c) 2008 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* wi... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps/avi | rapidsai_public_repos/code-share/maxflow/galois/apps/avi/libAVI/StandardAVI.h | /**
* StandardAVI.h
* DG++
*
* Created by Adrian Lew on 9/23/08.
*
* Copyright (c) 2008 Adrian Lew
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, includin... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/pta/CMakeLists.txt | app(pta)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/pta/PointsTo.cpp | /** Points-to Analysis application -*- C++ -*-
* @file
*
* An inclusion-based points-to analysis algorithm to demostrate the Galois system.
*
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2012, The University of Texas at Austin. All... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/boruvka/Boruvka.cpp | /** Spanning-tree application -*- C++ -*-
* @file
*
* A minimum spanning tree algorithm to demonstrate the Galois system.
*
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2012, The University of Texas at Austin. All rights reserved.
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/boruvka/CMakeLists.txt | app(boruvka Boruvka.cpp)
app(boruvka-merge BoruvkaMerge.cpp)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/boruvka/BoruvkaMerge.cpp | /** Boruvka application -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWAR... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/boruvka/UnionFind.h |
#ifndef GALOIS_UNION_FIND
#define GALOIS_UNION_FIND
template<typename ElTy, ElTy initializer>
struct UnionFind {
ElTy * parents;
const size_t size;
UnionFind(size_t sz) :
size(sz) {
parents = new ElTy [size];
for (size_t s = 0; s < sz; s++)
parents[s] = initializer;
}
ElTy uf... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalSerial.h | /** Kruskal Serial ordered version -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/CMakeLists.txt | app (KruskalSerial KruskalSerial.cpp)
app (KruskalHand KruskalHand.cpp)
app (KruskalOrdered KruskalOrdered.cpp)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalHand.cpp | /** Parallel Handwritten Kruskal -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalParallel.h | /** Kruskal MST -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE AND DO... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/Kruskal.h | /** Kruskal MST -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE AND DO... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalOrdered.h | /** Kruskal MST -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE AND DO... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalSerial.cpp | /** Serial Kruskal -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE AND... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalHand.h | /** Kruskal MST -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE AND DO... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/kruskal/KruskalOrdered.cpp | /** Parallel Kruskal -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE A... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/matching/CMakeLists.txt | app(bipartite-mcm bipartite-mcm.cpp)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/matching/bipartite-mcm.cpp | /** Maximum Cardinality Matching in Bipartite Graphs -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2012, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTI... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/Box3d.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/CMakeLists.txt | app(clustering)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/ClusterNode.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/AbstractNode.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/LeafNode.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/Point3.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/KdTree.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/Clustering.cpp | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/PotentialCluster.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/KdCell.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/clustering/NodeWrapper.h | /** Single source shortest paths -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/connectedcomponents/CMakeLists.txt | if(USE_EXP)
include_directories(../../exp/apps/connectedcomponents .)
endif()
app(connectedcomponents)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/connectedcomponents/ConnectedComponents.cpp | /** Connected components -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2013, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWA... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/surveypropagation/CMakeLists.txt | app(surveypropagation)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/surveypropagation/SurveyPropagation.cpp | /** Survey propagation -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTWARE... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/barneshut/CMakeLists.txt | if(CMAKE_COMPILER_IS_GNUCC)
set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -ffast-math")
endif()
app(barneshut Barneshut.cpp)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/barneshut/Point.h |
struct Point {
double val[3];
Point() { val[0] = val[1] = val[2] = 0.0; }
//Point(double _x, double _y, double _z) : val{_x,_y,_z} {}
Point(double _x, double _y, double _z) { val[0] = _x; val[1] = _y; val[2] = _z; }
//explicit Point(double v) : val{v,v,v} {}
explicit Point(double v) { val[0] = v; val[1] =... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/barneshut/Barneshut.cpp | /** Barnes-hut application -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2012, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFT... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/pagerank/CMakeLists.txt | if(USE_EXP)
include_directories(../../exp/apps/pagerank .)
endif()
app(pagerank PageRank.cpp)
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/pagerank/PageRank.h | #ifndef APPS_PAGERANK_PAGERANK_H
#define APPS_PAGERANK_PAGERANK_H
#include "llvm/Support/CommandLine.h"
//! d is the damping factor. Alpha is the prob that user will do a random jump, i.e., 1 - d
static const float alpha = 1.0 - 0.85;
//! maximum relative change until we deem convergence
static const float tolerance... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/apps | rapidsai_public_repos/code-share/maxflow/galois/apps/pagerank/PageRank.cpp | /** Page rank application -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2013, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SOFTW... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/sched.cpp | /** Scheduler Microbenchmark -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
* SO... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/empty-member-lcgraph.cpp | #include "Galois/Graph/LCGraph.h"
int main() {
constexpr size_t intvoid = sizeof(Galois::Graph::detail::EdgeInfoBase<int,void>);
constexpr size_t intint = sizeof(Galois::Graph::detail::EdgeInfoBase<int,int>);
static_assert(intvoid < intint, "Failed to do empty member optimization");
return intvoid < intint ? 0... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/loopoverhead.cpp | #include "Galois/Timer.h"
#include "Galois/Galois.h"
#include <iostream>
#include <cstdlib>
int RandomNumber () { return (rand()%1000000); }
const unsigned iter = 16*1024;
struct emp {
template<typename T>
void operator()(const T& t) { Galois::Runtime::LL::compilerBarrier(); }
template<typename T, typename C>
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/forward-declare-graph.cpp | #include "Galois/Graph/Graph.h"
#include "Galois/Graph/LCGraph.h"
struct Node1;
typedef Galois::Graph::FirstGraph<Node1, void, true> Graph1;
struct Node1 {
Graph1::edge_iterator edge;
Graph1::GraphNode gnode;
};
struct Node2;
typedef Galois::Graph::LC_CSR_Graph<Node2, void> Graph2;
struct Node2 {
Graph2::edge_i... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/twoleveliteratora.cpp | #include "Galois/config.h"
#include "Galois/TwoLevelIteratorA.h"
#include "Galois/Runtime/ll/gio.h"
#include <algorithm>
#include <boost/iterator/counting_iterator.hpp>
#include GALOIS_CXX11_STD_HEADER(vector)
#include <list>
#include <iostream>
const int N = 1024 * 4;
template<class D, class I>
struct GetBegin {
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/CMakeLists.txt | function(makeTest name)
add_executable(test-${name} ${name}.cpp)
target_link_libraries(test-${name} galois)
add_test(${name} test-${name})
endfunction()
makeTest(acquire)
makeTest(bandwidth)
makeTest(empty-member-lcgraph)
makeTest(flatmap)
makeTest(gdeque)
if(NOT CMAKE_CXX_COMPILER_ID MATCHES "XL")
makeTest(gr... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/graph-compile.cpp | #include "Galois/Graph/Graph.h"
struct NoDefault {
int x;
explicit NoDefault(int x): x(x) { }
private:
NoDefault();
};
template<typename GraphTy>
void check() {
typedef typename GraphTy::GraphNode GNode;
int v;
GraphTy g;
GNode n1 = g.createNode(v);
GNode n2 = g.createNode(v);
g.addNode(n1);
g.ad... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/bandwidth.cpp | #include "Galois/config.h"
#include "Galois/Galois.h"
#include "Galois/Timer.h"
#include GALOIS_CXX11_STD_HEADER(random)
#include <cstdio>
#include <time.h>
template<typename Gen>
void random_access(Gen& gen, int* buf, size_t size, size_t accesses) {
#if __cplusplus >= 201103L || defined(HAVE_CXX11_UNIFORM_INT_DISTRI... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/lock.cpp | #include "Galois/Runtime/ll/SimpleLock.h"
volatile int V;
int main(int argc, char** argv) {
Galois::Runtime::LL::SimpleLock<true> L;
for (unsigned x = 0; x < 1000000000; ++x) {
V = 0;
L.lock();
V = 1;
L.unlock();
V = 2;
}
return 0;
}
| 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/acquire.cpp | #include "Galois/Timer.h"
#include "Galois/Runtime/Context.h"
#include <iostream>
int main(int argc, char** argv) {
Galois::Runtime::SimpleRuntimeContext S;
Galois::Runtime::Lockable L;
Galois::Timer t;
t.start();
for (int x = 0; x < 1024*1024*1024; ++x)
Galois::Runtime::doAcquire(&L);
t.stop... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/pc.cpp | #include "Galois/Runtime/PerThreadStorage.h"
#include "Galois/Timer.h"
#include "Galois/Galois.h"
#include <iostream>
using namespace Galois::Runtime;
const int num = 1024 * 1024 * 1024;
template<typename T>
struct testL {
PerThreadStorage<T>& b;
testL(PerThreadStorage<T>& B) :b(B) {}
void operator()(unsigne... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/gdeque.cpp | #include <iostream>
#include "Galois/gdeque.h"
using namespace std;
using namespace Galois;
int main() {
gdeque<int> mydeque;
for (int i = 0; i < 10; ++i)
mydeque.push_back (i);
cout << "Start size of mydeque is " << int(mydeque.size());
cout << "\nBy Iter:";
for (gdeque<int>::iterator it=mydeque.b... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/sort.cpp | #include "Galois/Galois.h"
#include "Galois/ParallelSTL/ParallelSTL.h"
#include "Galois/Timer.h"
#include <iostream>
#include <cstdlib>
#include <numeric>
int RandomNumber () { return (rand()%1000000); }
bool IsOdd (int i) { return ((i%2)==1); }
struct IsOddS {
bool operator() (int i) { return ((i%2)==1); }
};
in... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/flatmap.cpp | #include "Galois/FlatMap.h"
#include "Galois/Timer.h"
#include <iostream>
#include <map>
template<typename T, int X>
void maptime(const char* c) {
T m;
Galois::Timer t1, t2;
t1.start();
for (int x = 0; x < X; ++x) {
m[x] = (double)x;
}
t1.stop();
t2.start();
for (int x = 0; x < X; ++x) {
m[x];... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/worklists-compile.cpp | /** Check worklist instantiations -*- C++ -*-
* @file
* @section License
*
* Galois, a framework to exploit amorphous data-parallelism in irregular
* programs.
*
* Copyright (C) 2011, The University of Texas at Austin. All rights reserved.
* UNIVERSITY EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES CONCERNING THIS
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/test/static.cpp | // std_tr1__type_traits__is_pod.cpp
#include "Galois/config.h"
#include "Galois/Runtime/ll/PtrLock.h"
#include "Galois/Runtime/ll/SimpleLock.h"
#include "Galois/Runtime/ll/StaticInstance.h"
#include GALOIS_CXX11_STD_HEADER(type_traits)
#include <iostream>
using namespace Galois::Runtime;
using namespace Galois::Ru... | 0 |
rapidsai_public_repos/code-share/maxflow/galois | rapidsai_public_repos/code-share/maxflow/galois/inputs/CMakeLists.txt | add_custom_target(more-inputs)
file(WRITE ${CMAKE_CURRENT_BINARY_DIR}/copyinputs.cmake
"file(COPY ${CMAKE_CURRENT_SOURCE_DIR} DESTINATION ${CMAKE_CURRENT_BINARY_DIR} PATTERN .svn EXCLUDE
PATTERN CMakeLists.txt EXCLUDE)")
add_custom_target(more-base-graphs COMMAND ${CMAKE_COMMAND} -P
${CMAKE_CURRENT_BINARY_DIR}/c... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/meshes/CMakeLists.txt | function(mesh base numpoints)
add_custom_command(OUTPUT ${base}.raw.node
COMMAND python ${CMAKE_BINARY_DIR}/tools/generators/random-2d-points.py
${numpoints} 1 > ${base}.raw.node)
add_custom_command(OUTPUT ${base}.node ${base}.ele ${base}.poly
COMMAND delaunaytriangulation
-noverify -writemesh ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/meshes/r10k.1.ele | 20001 3 0
0 7597 3480 5679
1 7597 5679 8158
2 7597 8158 2854
3 7597 8574 3480
4 7597 2854 8574
5 5329 3551 6978
6 5329 5463 3551
7 5329 6726 5463
8 5329 8946 6726
9 5329 9253 8946
10 5329 1685 6888
11 5329 6888 9253
12 5329 6978 1685
13 8305 1037 9838
14 8305 3677 1037
15 8305 4777 3677
16 8305 9838 4818
17 8305 4818 6... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/meshes/r10k.1.node | 10003 2 0 0
0 8444.218515 7579.544029 0
1 4205.715808 2589.167503 0
2 5112.747214 4049.341375 0
3 7837.98589 3033.127261 0
4 4765.969542 5833.820395 0
5 9081.128852 5046.868558 0
6 2818.378444 7558.042042 0
7 6183.689967 2505.063414 0
8 9097.46256 9827.85476 0
9 8102.17236 9021.659504 0
10 3101.475693 7298.317483 0
11 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/meshes/r10k.1.poly | 0 2 0 0
3 1
0 10002 10000 1
1 10001 10002 1
2 10000 10001 1
0
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/meshes/r10k.node | 10000 2 0 0
0 8444.218515 7579.544029 0
1 4205.715808 2589.167503 0
2 5112.747214 4049.341375 0
3 7837.985890 3033.127261 0
4 4765.969542 5833.820395 0
5 9081.128852 5046.868558 0
6 2818.378444 7558.042042 0
7 6183.689967 2505.063414 0
8 9097.462560 9827.854760 0
9 8102.172360 9021.659504 0
10 3101.475693 7298.317483 0... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/scalefree/CMakeLists.txt | function(rgraph base numnodes numedges)
add_custom_command(OUTPUT ${base}.dimacs
COMMAND python ${CMAKE_BINARY_DIR}/tools/generators/rmat.py
${CMAKE_BINARY_DIR}/tools/bin/GTgraph-rmat -n ${numnodes} -m ${numedges} ${base}.rmat
DEPENDS ${CMAKE_BINARY_DIR}/tools/bin/GTgraph-rmat)
add_custom_command(OUTP... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/koggeStone8bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/koggeStone16bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/adder16.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/multTree12bit.net |
finish 100000
inputs
a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11,
b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11,
GND
end
outputs
m0, m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12, m13, m14, m15, m16, m17, m18, m19, m20, m21, m22, m23,
end
outvalues
m0 1, m1 0, m2 0, m3 0, m4 0, m5 0, m6 0, m7 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/multTree6bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/koggeStone64bit.net |
finish 100000
inputs cin, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45, a46, a47, a48, a49, a50, a51, a52, a53, a54, a55, a56, a57, a58, a59, a6... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/koggeStone32bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/xor2x1NandArray1.net | inputs a0, b0,
end
outputs o0,
end
finish=10000
initlist a0
0, 0
end
initlist b0
0, 0
end
outvalues
o0 0,
end
netlist
nand2(x0,a0,b0)#40
nand2(y0,a0,x0)#40
nand2(z0,b0,x0)#40
nand2(o0,y0,z0)#40
end
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/treeMult4bit.net |
finish 100000
inputs
a0, a1, a2, a3,
b0, b1, b2, b3,
GND
end
outputs
m0, m1, m2, m3, m4, m5, m6, m7,
end
outvalues
m0 1, m1 0, m2 0, m3 0, m4 0, m5 1, m6 1, m7 1,
end
initlist GND 0 0 end
initlist a0 0,0 63, 1 end
initlist a1 0,0 8, 1 end
initlist a2 0,0 6, 1 end
initlist a3 0,0 10, 1 end
initli... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/csaArray32.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/xor.net | inputs a,b end
outputs o end
finish=40
initlist a
0,0
5,1
10,0
15,1
end
initlist b
0,0
10,1
20,0
end
outvalues o 1 end
netlist
nand2(x,a,b)#4
nand2(y,a,x)#4
end
netlist
nand2(z,b,x)#4
nand2(o,y,z)#4
end
| 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/multTree8bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/adder8.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/multTree10bit.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/adder12.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/adder1.net |
finish 10000
inputs cin, a, b
end
outputs cout, s
end
initlist a 0,0 59, 0 end
initlist b 0,0 39, 0 end
initlist cin 0,0 16, 1 end
outvalues cout 0, s 1, end
netlist
inv(an,a)#4
inv(bn,b)#4
inv(cinn,cin)#4
and2(anbn,an,bn)#2
and2(anb,an,b)#2
and2(abn,a,bn)#2
and2(ab,a,b)#3
and2(abcin,ab,cin)#2
and2(anb... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/csaArray16.net | // Lonestar Benchmark Suite for irregular applications that exhibit
// amorphous data-parallelism.
//
// Center for Grid and Distributed Computing
// The University of Texas at Austin
//
// Copyright (C) 2007, 2008, 2009 The University of Texas at Austin
//
// Licensed under the Eclipse Public License, Version 1.0 ... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/xor2x1NandArray4.net | inputs a0, b0, a1, b1, a2, b2, a3, b3,
end
outputs o0, o1, o2, o3,
end
finish=10000
initlist a0
0, 0
5, 1
10, 0
15, 1
20, 0
25, 1
30, 0
35, 1
40, 0
45, 1
50, 0
55, 1
60, 0
65, 1
70, 0
75, 1
end
initlist a1
0, 0
5, 1
10, 0
15, 1
20, 0
25, 1
30, 0
35, 1
40, 0
45, 1
50, 0
55, 1
60, 0
65, 1
70, 0
75, 1
end
initlist a2... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/csaArray8.net |
finish 100000
inputs
a0, a1, a2, a3, a4, a5, a6, a7
b0, b1, b2, b3, b4, b5, b6, b7
c0, c1, c2, c3, c4, c5, c6, c7
end
initlist a0 0,0 94,1
147,0
206,1
291,0
381,1
390,0
463,1
524,0
545,1
593,0
671,1
706,0
766,1
814,0
828,1
842,0
929,1
958,0
975,1
990,0
1089,1
1107,0
1119... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/des/koggeStone128bit.net |
finish 100000
inputs cin, a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45, a46, a47, a48, a49, a50, a51, a52, a53, a54, a55, a56, a57, a58, a59, a6... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/avi/CMakeLists.txt | find_program(WGET wget)
find_program(GUNZIP gunzip)
function(dlinput base url)
add_custom_command(OUTPUT ${base}.gz
COMMAND ${WGET} -O ${base}.gz ${url})
endfunction(dlinput)
dlinput(10x10_42k.NEU.gz http://iss.ices.utexas.edu/projects/galois/downloads/inputs/avi/10x10_42k.NEU.gz)
add_custom_target(more-avi-in... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/pta/ex_constraints.txt | 11078
13216
0,1,2,0,0
1,3,2264,0,0
2,4,3,0,0
3,5,2275,0,0
4,7,2277,0,0
5,9,2278,0,0
6,11,2279,0,0
7,13,2286,0,0
8,14,2287,0,0
9,15,2289,0,0
10,17,2291,0,0
11,19,2296,0,0
12,21,2297,0,0
13,23,2298,0,0
14,25,2299,0,0
15,27,2300,0,0
16,29,2301,0,0
17,31,2302,0,0
18,33,2308,0,0
19,35,2317,0,0
20,39,2318,0,0
21,43,2329,0,0
... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/random/CMakeLists.txt | function(rgraph base numnodes)
add_custom_command(OUTPUT ${base}.dimacs
COMMAND python ${CMAKE_BINARY_DIR}/tools/generators/random-graph.py --density 4
${numnodes} 0 > ${base}.dimacs)
add_custom_command(OUTPUT ${base}.gr
COMMAND graph-convert-standalone -dimacs2gr ${base}.dimacs ${base}.gr
DEPENDS... | 0 |
rapidsai_public_repos/code-share/maxflow/galois/inputs | rapidsai_public_repos/code-share/maxflow/galois/inputs/road/CMakeLists.txt | find_program(WGET wget)
find_program(GUNZIP gunzip)
function(dlinput base url)
add_custom_command(OUTPUT ${base}.gz
COMMAND ${WGET} -O ${base}.gz ${url})
add_custom_command(OUTPUT ${base}.dimacs
COMMAND ${GUNZIP} -c ${base}.gz > ${base}.dimacs
DEPENDS ${base}.gz)
add_custom_command(OUTPUT ${base}.gr
... | 0 |
rapidsai_public_repos/code-share/maxflow | rapidsai_public_repos/code-share/maxflow/push-relabel/push-relabel_operations_gpu.cu | //Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.
#include <stdio.h>
#include <limits.h>
//#include "../utils.cu"
#include "vector_types.h"
#include "push-relabel_operations.h"
//Number of times the push/relabel method is applied between two global relabeling
#define KERNEL_CYCLES 10
//Number of threads ... | 0 |
rapidsai_public_repos/code-share/maxflow | rapidsai_public_repos/code-share/maxflow/push-relabel/push-relabel_operations_cpu_omp.cpp | #include <climits>
#include <algorithm>
#include <functional>
#define DISCHARGE_CYCLES 1000
//returns true is the node is active
inline bool is_active(int u, int* h, double* e, int num_nodes) {
return (h[u] < num_nodes && e[u] > 0);
}
void discharge(double *cf, int num_nodes, int s, int t, int *row_offsets, int *co... | 0 |
rapidsai_public_repos/code-share/maxflow | rapidsai_public_repos/code-share/maxflow/push-relabel/push-relabel.cpp | // Copyright (c) 2016, NVIDIA CORPORATION. All rights reserved.
#include "../matrix.h"
#include "../allocator.h"
#include <stdio.h>
#include "push-relabel_operations.h"
#include "../bfs/bfs.h"
#include "../graph_tools.h"
#include <unistd.h>
//#define REORDER_GRAPH
//Push-relabel max flow implementation
//GPU impleme... | 0 |
rapidsai_public_repos/code-share/maxflow | rapidsai_public_repos/code-share/maxflow/push-relabel/push-relabel_operations.h | bool discharge(double *cf, int num_nodes, int s, int t, int *row_offsets, int *col_indices, int *reverse, double *e, int *h, int *q, int *active_blocks);
void remove_violating_edges(double *cf, int num_nodes, int *row_offsets, int *col_indices, int *reverse, double *e, int *h, int *active_blocks);
void global_gap_re... | 0 |
rapidsai_public_repos/code-share/maxflow | rapidsai_public_repos/code-share/maxflow/boost_push_relabel/push-relabel.cpp | #include <boost/config.hpp>
#include <iostream>
#include <string>
#include <boost/graph/push_relabel_max_flow.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/read_dimacs.hpp>
#include <boost/graph/graph_utility.hpp>
#include <time.h>
#include <fstream>
using std::istream;
int main() {
using name... | 0 |
rapidsai_public_repos | rapidsai_public_repos/kvikio/.pre-commit-config.yaml | # Copyright (c) 2019-2022, NVIDIA CORPORATION.
repos:
- repo: https://github.com/pre-commit/pre-commit-hooks
rev: v4.4.0
hooks:
- id: trailing-whitespace
- id: end-of-file-fixer
- repo: https://github.com/PyCQA/isort
rev: 5.12.0
hooks:
- id: isort
args: ["--config-root=pyt... | 0 |
rapidsai_public_repos | rapidsai_public_repos/kvikio/.flake8 | # Copyright (c) 2023, NVIDIA CORPORATION.
[flake8]
filename = *.py, *.pyx, *.pxd, *.pxi
force-check = True
max-line-length = 88
exclude =
.eggs,
*.egg,
build,
docs,
.git,
_skbuild,
ignore =
# line break before binary operator
W503,
# whitespace before :
E203
per-file-ignores =
... | 0 |
rapidsai_public_repos | rapidsai_public_repos/kvikio/README.md | # KvikIO: High Performance File IO
## Summary
KvikIO is a Python and C++ library for high performance file IO. It provides C++ and Python
bindings to [cuFile](https://docs.nvidia.com/gpudirect-storage/api-reference-guide/index.html),
which enables [GPUDirect Storage (GDS)](https://developer.nvidia.com/blog/gpudirect-... | 0 |
rapidsai_public_repos | rapidsai_public_repos/kvikio/CHANGELOG.md | # kvikio 23.10.00 (11 Oct 2023)
## 🚨 Breaking Changes
- Update to Cython 3.0.0 ([#258](https://github.com/rapidsai/kvikio/pull/258)) [@vyasr](https://github.com/vyasr)
## 🐛 Bug Fixes
- Add numcodecs pin ([#300](https://github.com/rapidsai/kvikio/pull/300)) [@vyasr](https://github.com/vyasr)
- Add missed filename ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.