repo stringlengths 1 152 ⌀ | file stringlengths 14 221 | code stringlengths 501 25k | file_length int64 501 25k | avg_line_length float64 20 99.5 | max_line_length int64 21 134 | extension_type stringclasses 2
values |
|---|---|---|---|---|---|---|
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/matching.h | /******************************************************************************
* matching.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MATCHING_QL4RUO3D
#define MATCHING_QL4RUO3D
#include "data_structure/g... | 990 | 32.033333 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/compare_degrees.h | /******************************************************************************
* compare_degrees.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef COMPARE_DEGREES_750FUZ7Z
#define COMPARE_DEGREES_750FUZ7Z
class... | 885 | 33.076923 | 96 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/gpa/path.h | /******************************************************************************
* path.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PATH_X5LQS3DT
#define PATH_X5LQS3DT
#include "definitions.h"
class path {... | 2,513 | 23.407767 | 87 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/gpa/compare_rating.h | /******************************************************************************
* compare_rating.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef COMPARE_RATING_750FUZ7Z
#define COMPARE_RATING_750FUZ7Z
#include... | 901 | 30.103448 | 90 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/gpa/path_set.h | /******************************************************************************
* path_set.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PATH_SET_80E9CQT1
#define PATH_SET_80E9CQT1
#include "data_structure/g... | 9,338 | 39.604348 | 103 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/matching/gpa/gpa_matching.h | /******************************************************************************
* gpa_matching.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GPA_MATCHING_NXLQ0SIT
#define GPA_MATCHING_NXLQ0SIT
#include "coar... | 2,798 | 42.734375 | 90 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/coarsening/edge_rating/edge_ratings.h | /******************************************************************************
* edge_ratings.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef EDGE_RATING_FUNCTIONS_FUCW7H6Y
#define EDGE_RATING_FUNCTIONS_FUCW7H... | 1,055 | 32 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/uncoarsening.h | /******************************************************************************
* uncoarsening.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef UNCOARSENING_XSN847F2
#define UNCOARSENING_XSN847F2
#include "data... | 634 | 25.458333 | 94 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/separator/vertex_separator_flow_solver.h | /******************************************************************************
* vertex_separator_flow_solver.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef VERTEX_SEPARATOR_FLOW_SOLVER_FLA4518Q
#define VERTE... | 1,542 | 34.883721 | 82 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/separator/vertex_separator_algorithm.h | /******************************************************************************
* vertex_separator_algorithm.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef VERTEX_SEPARTATOR_ALGORITHM_XUDNZZM8
#define VERTEX_S... | 1,765 | 40.069767 | 105 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/refinement.h | /******************************************************************************
* refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef REFINEMENT_UJN9IBHM
#define REFINEMENT_UJN9IBHM
#include "data_struc... | 798 | 28.592593 | 80 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/mixed_refinement.h | /******************************************************************************
* mixed_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MIXED_REFINEMENT_XJC6COP3
#define MIXED_REFINEMENT_XJC6COP3
#i... | 770 | 28.653846 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/tabu_search/tabu_search.h | /******************************************************************************
* tabu_search.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TABU_SEARCH_RC6W8GX
#define TABU_SEARCH_RC6W8GX
#include "data_stru... | 1,734 | 24.895522 | 88 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/tabu_search/tabu_bucket_queue.h | /******************************************************************************
* tabu_bucket_queue.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TABU_BUCKET_PQ_EM8YJPA9
#define TABU_BUCKET_PQ_EM8YJPA9
#incl... | 6,417 | 35.465909 | 117 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/tabu_search/tabu_moves_queue.h | /******************************************************************************
* tabu_moves_queue.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TABU_MOVES_PQ_EM8YJPA9
#define TABU_MOVES_PQ_EM8YJPA9
#include... | 2,069 | 25.202532 | 89 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_refinement.h | /******************************************************************************
* quotient_graph_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef QUOTIENT_GRAPH_REFINEMENT_A0Y1Y6LL
#define QUOTIENT_GR... | 1,938 | 44.093023 | 120 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/two_way_refinement.h | /******************************************************************************
* two_way_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TWO_WAY_REFINEMENT_INTERFACE_1ZWCSI0J
#define TWO_WAY_REFINEM... | 1,435 | 42.515152 | 96 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/boundary_lookup.h | /******************************************************************************
* boundary_lookup.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef BOUNDARY_LOOKUP_2JMSKBSI
#define BOUNDARY_LOOKUP_2JMSKBSI
#incl... | 2,192 | 26.759494 | 123 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/boundary_bfs.h | /******************************************************************************
* boundary_bfs.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef BOUNDARY_BFS_4AJLJJAB
#define BOUNDARY_BFS_4AJLJJAB
#include "data... | 1,042 | 33.766667 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/two_way_flow_refinement.h | /******************************************************************************
* two_way_flow_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TWO_WAY_FLOW_REFINEMENT_BVTL6G49
#define TWO_WAY_FLOW_RE... | 3,643 | 56.84127 | 99 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.h | /******************************************************************************
* most_balanced_minimum_cuts.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MOST_BALANCED_MINIMUM_CUTS_SBD5CS
#define MOST_BALANC... | 1,766 | 42.097561 | 92 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/cut_flow_problem_solver.h | /******************************************************************************
* cut_flow_problem_solver.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef CUT_FLOW_PROBLEM_SOLVER_4P49OMM
#define CUT_FLOW_PROBLEM... | 2,628 | 45.946429 | 100 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/partition_accept_rule.h | /******************************************************************************
* partition_accept_rule.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PARTITION_ACCEPT_RULE_4RXUS4P9
#define PARTITION_ACCEPT_RU... | 7,714 | 42.100559 | 124 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.h | /******************************************************************************
* two_way_fm.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TWOWAY_FM_YLYN82Y1
#define TWOWAY_FM_YLYN82Y1
#include <vector>
#in... | 6,176 | 42.808511 | 91 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/vertex_moved_hashtable.h | /******************************************************************************
* vertex_moved_hashtable.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef VMOVEDHT_4563r97820954
#define VMOVEDHT_4563r97820954
#i... | 985 | 21.409091 | 104 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/search_stop_rule.h | /******************************************************************************
* search_stop_rule.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef SEARCH_STOP_RULE_R20GH6IN
#define SEARCH_STOP_RULE_R20GH6IN
cl... | 1,335 | 34.157895 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/queue_selection_strategie.h | /******************************************************************************
* queue_selection_strategie.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef QUEUESELECTIONSTRATEGIE_H_
#define QUEUESELECTIONSTRAT... | 8,879 | 45.25 | 104 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/simple_quotient_graph_scheduler.h | /******************************************************************************
* simple_quotient_graph_scheduler.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef SIMPLE_QUOTIENT_GRAPH_SCHEDULER_YG9BEBH0
#define... | 1,433 | 33.97561 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/active_block_quotient_graph_scheduler.h | /******************************************************************************
* active_block_quotient_graph_scheduler.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef ACTIVE_BLOCK_QUOTIENT_GRAPH_SCHEDULER_2QAT... | 3,501 | 37.065217 | 123 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/quotient_graph_scheduling.h | /******************************************************************************
* quotient_graph_scheduling.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef QUOTIENT_GRAPH_SCHEDULING_NEFT9H3J
#define QUOTIENT_GR... | 1,225 | 30.435897 | 109 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.h | /******************************************************************************
* augmented_Qgraph_fabric.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef AUGMENTED_QGRAPH_FABRIC_MULTITRY_FM_PVGY97EW
#define AUG... | 18,912 | 44.683575 | 119 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.h | /******************************************************************************
* greedy_neg_cycle.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GREEDY_NEG_CYCLE_IVBKH6WD
#define GREEDY_NEG_CYCLE_IVBKH6WD
#i... | 12,415 | 42.111111 | 119 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.h | /******************************************************************************
* problem_factory.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PROBLEM_FACTORY_KHGQXT9H
#define PROBLEM_FACTORY_KHGQXT9H
#incl... | 6,558 | 44.548611 | 129 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.h | /******************************************************************************
* cycle_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef CYCLE_REFINEMENT_JEPIS3F0
#define CYCLE_REFINEMENT_JEPIS3F0
#i... | 1,794 | 36.395833 | 88 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/label_propagation_refinement/label_propagation_refinement.h | /******************************************************************************
* label_propagation_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef LABEL_PROPAGATION_REFINEMENT_R4XW141Y
#define LAB... | 858 | 30.814815 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_core.h | /******************************************************************************
* kway_graph_refinement_core.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef KWAY_GRAPH_REFINEMENT_CORE_PVGY97EW
#define KWAY_GRAP... | 7,173 | 47.147651 | 129 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_commons.h | /******************************************************************************
* kway_graph_refinement_commons.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef KWAY_GRAPH_REFINEMENT_COMMONS_PVGY97EW
#define KWA... | 7,351 | 38.956522 | 122 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement.h | /******************************************************************************
* kway_graph_refinement.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef KWAY_GRAPH_REFINEMENT_PVGY97EW
#define KWAY_GRAPH_REFINEME... | 1,500 | 35.609756 | 104 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/kway_graph_refinement/multitry_kway_fm.h | /******************************************************************************
* multitry_kway_fm.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MULTITRY_KWAYFM_PVGY97EW
#define MULTITRY_KWAYFM_PVGY97EW
#inc... | 1,963 | 40.787234 | 115 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_stop_rule.h | /******************************************************************************
* kway_stop_rule.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef KWAY_STOP_RULE_ULPK0ZTF
#define KWAY_STOP_RULE_ULPK0ZTF
class kw... | 3,728 | 37.443299 | 130 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/flow_graph.h | /******************************************************************************
* flow_graph.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning
*
*****************************************************************************/
#ifndef FLOW_GRAPH_636S5L2S
#define FLOW_GRAPH_636S5L2S
#include "definitio... | 3,691 | 28.536 | 121 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/union_find.h | /******************************************************************************
* union_find.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef UNION_FIND_H
#define UNION_FIND_H
#include <vector>
// A simple Uni... | 2,272 | 33.439394 | 99 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/graph_access.h | /******************************************************************************
* graph_access.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GRAPH_ACCESS_EFRXO4X2
#define GRAPH_ACCESS_EFRXO4X2
#include <bits... | 15,362 | 30.09919 | 124 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/graph_hierarchy.h | /******************************************************************************
* graph_hierarchy.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GRAPH_HIERACHY_UMHG74CO
#define GRAPH_HIERACHY_UMHG74CO
#includ... | 1,263 | 28.395349 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/matrix/matrix.h | /******************************************************************************
* matrix.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MATRIX_BHHZ9T7P
#define MATRIX_BHHZ9T7P
class matrix {
public:
m... | 630 | 26.434783 | 79 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/matrix/normal_matrix.h | /******************************************************************************
* normal_matrix.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef NORMAL_MATRIX_DAUJ4JMM
#define NORMAL_MATRIX_DAUJ4JMM
#include "m... | 1,763 | 35.75 | 122 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/priority_queues/maxNodeHeap.h | /******************************************************************************
* maxNodeHeap.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MAX_NODE_HEAP_39CK1B8I
#define MAX_NODE_HEAP_39CK1B8I
#include <lim... | 9,719 | 32.633218 | 118 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/priority_queues/bucket_pq.h | /******************************************************************************
* bucket_pq.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef BUCKET_PQ_EM8YJPA9
#define BUCKET_PQ_EM8YJPA9
#include <limits>
#incl... | 4,684 | 29.032051 | 106 | h |
KaMIS | KaMIS-master/extern/KaHIP/lib/data_structure/priority_queues/priority_queue_interface.h | /******************************************************************************
* priority_queue_interface.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PRIORITY_QUEUE_INTERFACE_20ZSYG7R
#define PRIORITY_QUEU... | 1,432 | 33.95122 | 79 | h |
KaMIS | KaMIS-master/app/parse_parameters_omis.h | /**
* parse_parameters.h
* Purpose: Parse command line parameters.
*
*****************************************************************************/
#ifndef _PARSE_PARAMETERS_H_
#define _PARSE_PARAMETERS_H_
#include <omp.h>
#include "configuration_mis.h"
/**
* Parse the given parameters and apply them to the co... | 3,421 | 29.283186 | 80 | h |
KaMIS | KaMIS-master/app/configuration_mis.h | /**
* configuration.h
* Purpose: Contains preset configurations for the evolutionary algorithms.
*
*****************************************************************************/
#ifndef _CONFIGURATION_MIS_H_
#define _CONFIGURATION_MIS_H_
#include "definitions.h"
#include "mis_config.h"
#ifdef OMIS
const int FAST... | 5,294 | 34.536913 | 79 | h |
KaMIS | KaMIS-master/lib/tools/mis_log.h | /******************************************************************************
* mis_log.h
*
*****************************************************************************/
#ifndef _MIS_LOG_H_
#define _MIS_LOG_H_
#include <sstream>
#include "timer.h"
#include "mis_config.h"
#include "data_structure/graph_access.h... | 7,978 | 24.012539 | 109 | h |
KaMIS | KaMIS-master/lib/mis/mis_config.h | /**
* mis_config.h
* Purpose: Configuration used for the evolutionary maximum independent set algorithms.
*
*****************************************************************************/
#ifndef _MIS_CONFIG_H_
#define _MIS_CONFIG_H_
#include <string>
#include "definitions.h"
// Configuration for the calculation... | 3,575 | 34.405941 | 87 | h |
KaMIS | KaMIS-master/lib/mis/evolutionary/population_mis.h | /**
* population_mis.h
* Purpose: Represents the population used in the evolutionary framework.
* This includes combine, mutate and selection operators.
*
*****************************************************************************/
#ifndef _POPULATION_MIS_H_
#define _POPULATION_MIS_H_
#include "defini... | 9,147 | 32.386861 | 132 | h |
KaMIS | KaMIS-master/lib/mis/evolutionary/reduction_evolution.h | /**
* reduction_evolution.h
* Purpose: Recursive evolutionary framework including reduction techniques.
*
*****************************************************************************/
#ifndef _REDUCTION_EVOLUTION_H_
#define _REDUCTION_EVOLUTION_H_
#include "timer.h"
#include "mis_config.h"
#include "population_m... | 9,045 | 38.330435 | 88 | h |
KaMIS | KaMIS-master/lib/mis/kernel/branch_and_reduce_algorithm.h | /******************************************************************************
* branch_and_reduce_algorithm.h
*
*****************************************************************************/
#ifndef BRANCH_AND_REDUCE_SOLVER_H
#define BRANCH_AND_REDUCE_SOLVER_H
// local includes
#include "fast_set.h"
#include "... | 3,865 | 21.476744 | 124 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/LinearTime/MIS_sigmod_pub/Utility.h | /******************************************************************************
* Copyright (C) 2019 Lijun Chang <ljchang.au@gmail.com>
*
* 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... | 1,894 | 29.564516 | 81 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/SimpleSet.h | /******************************************************************************
* Copyright (C) 2019 Demian Hespe <hespe@kit.edu>
*
* 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 witho... | 2,193 | 27.868421 | 81 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/full_reductions.h | /******************************************************************************
* Copyright (C) 2019 Demian Hespe <hespe@kit.edu>
*
* 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 witho... | 2,302 | 39.403509 | 82 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/configuration_mis.h | /**
* configuration.h
* Purpose: Contains preset configurations for the evolutionary algorithms.
*
*****************************************************************************/
#ifndef _CONFIGURATION_MIS_H_
#define _CONFIGURATION_MIS_H_
#include "definitions.h"
#include "mis_config.h"
#include "interface/kaHIP_i... | 2,276 | 26.433735 | 79 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/bucket_pq.h | /******************************************************************************
* bucket_pq.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef BUCKET_PQ_EM8YJPA9
#define BUCKET_PQ_EM8YJPA9
#include <limits>
#incl... | 4,395 | 27.36129 | 106 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/Reduction.h | /******************************************************************************
* Copyright (C) 2015-2017 Darren Strash <strash@kit.edu>
*
* 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 Softwar... | 2,774 | 28.83871 | 130 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/src/data_structures/array_set.h | /**
* array_set.h
* Purpose: Dynamic array representation for sets with a given range of elements.
* Lookups can be performed in constant time using a dedicated array.
*
* The original code was kindly provided by Darren Strash.
*
**************************************************************************... | 6,859 | 27.702929 | 99 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/definitions.h | /******************************************************************************
* definitions.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef DEFINITIONS_H_CHR
#define DEFINITIONS_H_CHR
#include <limits>
#incl... | 3,918 | 23.647799 | 95 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/tools/timer.h | /******************************************************************************
* timer.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef TIMER_9KPDEP
#define TIMER_9KPDEP
#include <sys/time.h>
#include <sys/res... | 1,106 | 25.357143 | 88 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/tools/macros_assertions.h | /******************************************************************************
* macros_assertions.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef ASSERT_H
#define ASSERT_H
#include <cassert>
#include <cmath>... | 6,270 | 33.456044 | 93 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/tools/macros_common.h | /******************************************************************************
* macros_common.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MACROS_COMMON_H
#define MACROS_COMMON_H
// If DEBU... | 1,067 | 22.217391 | 79 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/io/graph_io.h | /******************************************************************************
* graph_io.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GRAPHIO_H_
#define GRAPHIO_H_
#include <fstream>
#include <iostream>
#... | 2,591 | 26.284211 | 93 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/data_structure/graph_access.h | /******************************************************************************
* graph_access.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef GRAPH_ACCESS_EFRXO4X2
#define GRAPH_ACCESS_EFRXO4X2
#include <bits... | 15,362 | 30.09919 | 124 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/data_structure/priority_queues/maxNodeHeap.h | /******************************************************************************
* maxNodeHeap.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef MAX_NODE_HEAP_39CK1B8I
#define MAX_NODE_HEAP_39CK1B8I
#include <lim... | 9,719 | 32.633218 | 118 | h |
KaMIS | KaMIS-master/lib/mis/kernel/ParFastKer/fast_reductions/extern/KaHIP/lib/data_structure/priority_queues/priority_queue_interface.h | /******************************************************************************
* priority_queue_interface.h
*
* Source of KaHIP -- Karlsruhe High Quality Partitioning.
*
*****************************************************************************/
#ifndef PRIORITY_QUEUE_INTERFACE_20ZSYG7R
#define PRIORITY_QUEU... | 1,432 | 33.95122 | 79 | h |
KaMIS | KaMIS-master/lib/mis/initial_mis/greedy_mis.h | /**
* greedy_mis.h
* Purpose: Compute an initial solution (maximum independent set)
* by using a greedy algorithm, that always picks the node
* with the smallest residual degree.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*******************************... | 1,407 | 25.566038 | 79 | h |
KaMIS | KaMIS-master/lib/mis/initial_mis/greedy_vertex.h | /**
* greedy_vertex.h
* Purpose: Compute an initial solution (maximum independent set) by
* building a minimal vertex cover.
*
*****************************************************************************/
#ifndef _GREEDY_VERTEX_H_
#define _GREEDY_VERTEX_H_
#include "initial_mis.h"
#include "data_struc... | 1,293 | 24.88 | 79 | h |
KaMIS | KaMIS-master/lib/mis/initial_mis/initial_mis.h | /**
* initial_mis.h
* Purpose: Interface for different initial solution algorithms.
*
*****************************************************************************/
#ifndef _INITIAL_MIS_H_
#define _INITIAL_MIS_H_
#include "data_structure/graph_access.h"
class initial_mis {
public:
/**
* Defa... | 782 | 20.75 | 79 | h |
KaMIS | KaMIS-master/lib/mis/initial_mis/random_mis.h | /**
* random_mis.h
* Purpose: Compute an initial solution (maximum independent set)
* by using a simple random selection of vertices.
*
*****************************************************************************/
#ifndef _RANDOM_MIS_H_
#define _RANDOM_MIS_H_
#include "initial_mis.h"
#include "data_st... | 1,204 | 23.591837 | 79 | h |
KaMIS | KaMIS-master/lib/mis/initial_mis/greedy_mis_online.h | /**
* greedy_mis.h
* Purpose: Compute an initial solution (maximum independent set)
* by using a greedy algorithm, that always picks the node
* with the smallest residual degree.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
********************************... | 1,417 | 24.781818 | 79 | h |
KaMIS | KaMIS-master/lib/mis/ils/online_ils.h | /**
* online_ils.h
* Purpose: Perform the iterated local search (ILS) as described by Andrade et
*al.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _ONLINEILS_H_
#define _ONLINEILS_H_
#in... | 2,854 | 23.194915 | 79 | h |
KaMIS | KaMIS-master/lib/mis/ils/ils.h | /**
* ils.h
* Purpose: Perform the iterated local search (ILS) as described by Andrade et al.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _ILS_H_
#define _ILS_H_
#include <vector>
#incl... | 2,814 | 27.72449 | 102 | h |
KaMIS | KaMIS-master/lib/mis/ils/local_search.h | /**
* local_search.h
* Purpose: Apply the local search algorithm to a maximum independent set.
*
* The original code from Andrade et. al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _DIRECT_LOCAL_H_
#define _DIRECT_LOCAL_H_
#inc... | 4,962 | 29.826087 | 114 | h |
KaMIS | KaMIS-master/lib/mis/ils/local_search_online.h | /**
* local_search_online.h
* Purpose: Apply the local search algorithm to a maximum independent set.
*
* The original code from Andrade et. al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _DIRECT_LOCAL_ONLINE_H_
#define _DIRECT... | 4,893 | 27.788235 | 80 | h |
KaMIS | KaMIS-master/lib/data_structure/mis_permutation.h | /**
* mis_permutation.h
* Purpose: Data structure used for the local search algorithm.
* The structure itself is a permutation of all nodes divided into three blocks.
* The first block contains the solution nodes.
* The second block contains free nodes.
* The third block contai... | 7,858 | 29.226923 | 89 | h |
KaMIS | KaMIS-master/lib/data_structure/candidate_list.h | /**
* candidate_list.h
* Purpose: Represents the list used to store the candidates for the local search.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _CANDIDATE_LIST_H_
#define _CANDIDATE_... | 3,835 | 27.842105 | 82 | h |
KaMIS | KaMIS-master/lib/data_structure/array_set.h | /**
* array_set.h
* Purpose: Dynamic array representation for sets with a given range of elements.
* Lookups can be performed in constant time using a dedicated array.
*
* The original code was kindly provided by Darren Strash.
*
**************************************************************************... | 6,859 | 27.702929 | 99 | h |
KaMIS | KaMIS-master/lib/data_structure/sparse_array_set.h | /**
* sparse_array_set.h
* Purpose: Dynamic array representation for sparse sets.
* Lookups may need linear time.
*
* The original code was kindly provided by Darren Strash.
*
*****************************************************************************/
#ifndef _SPARSE_ARRAY_SET_H
#define _SPARSE_ARRA... | 5,611 | 26.111111 | 92 | h |
KaMIS | KaMIS-master/lib/data_structure/candidate_list_online.h | /**
* candidate_list.h
* Purpose: Represents the list used to store the candidates for the local search.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _CANDIDATE_LIST_H_
#define _CANDIDATE_... | 3,833 | 28.045455 | 82 | h |
KaMIS | KaMIS-master/lib/data_structure/mis_permutation_online.h | /**
* mis_permutation.h
* Purpose: Data structure used for the local search algorithm.
* The structure itself is a permutation of all nodes divided into
*three blocks. The first block contains the solution nodes. The second block
*contains free nodes. The third block contains all remaining
*(non-free, no... | 8,265 | 25.925081 | 80 | h |
KaMIS | KaMIS-master/lib/data_structure/priority_queues/bucket_array.h | /**
* bucket_array.h
* Purpose: A bucket priority queue used for building initial maximum independent sets.
*
* The original code from Andrade et al. was kindly provided by Renato Werneck.
*
*****************************************************************************/
#ifndef _BUCKET_ARRAY_H_
#define _BUCKET_AR... | 3,033 | 26.089286 | 87 | h |
null | ADSampling-main/src/matrix.h |
#pragma once
#ifndef MATRIX_HPP_
#define MATRIX_HPP_
#include <cstddef>
#include <iostream>
#include <fstream>
#include <cmath>
#include <random>
#include <cstring>
#include <assert.h>
#include <Eigen/Dense>
template <typename T>
class Matrix
{
private:
public:
T* data;
size_t n;
size_t d;
Matrix();... | 2,645 | 20.688525 | 94 | h |
null | ADSampling-main/src/hnswlib/visited_list_pool.h | #pragma once
#include <mutex>
#include <string.h>
#include <deque>
namespace hnswlib {
typedef unsigned short int vl_type;
class VisitedList {
public:
vl_type curV;
vl_type *mass;
unsigned int numelements;
VisitedList(int numelements1) {
curV = -1;
... | 1,995 | 23.95 | 63 | h |
null | ADSampling-main/src/hnswlib/space_l2.h | #pragma once
#include "hnswlib.h"
namespace hnswlib {
static float
L2Sqr(const void *pVect1v, const void *pVect2v, const void *qty_ptr) {
float *pVect1 = (float *) pVect1v;
float *pVect2 = (float *) pVect2v;
size_t qty = *((size_t *) qty_ptr);
float res = 0;
for (size_... | 9,733 | 27.970238 | 117 | h |
null | ADSampling-main/src/hnswlib/hnswlib.h | #pragma once
#ifndef NO_MANUAL_VECTORIZATION
#ifdef __SSE__
#define USE_SSE
#ifdef __AVX__
#define USE_AVX
#ifdef __AVX512F__
#define USE_AVX512
#endif
#endif
#endif
#endif
#if defined(USE_AVX) || defined(USE_SSE)
#ifdef _MSC_VER
#include <intrin.h>
#include <stdexcept>
#include "cpu_x86.h"
void cpu_x86::cpuid(int32_t... | 4,910 | 24.445596 | 108 | h |
null | ADSampling-main/src/hnswlib/bruteforce.h | #pragma once
#include <unordered_map>
#include <fstream>
#include <mutex>
#include <algorithm>
namespace hnswlib {
template<typename dist_t>
class BruteforceSearch : public AlgorithmInterface<dist_t> {
public:
BruteforceSearch(SpaceInterface <dist_t> *s) {
}
BruteforceSearch(SpaceI... | 5,488 | 34.875817 | 119 | h |
null | ADSampling-main/src/ivf/ivf.h | /*
We highlight the function search which are closely related to our proposed algorithms.
We have included detailed comments in these functions.
We explain the important variables for the enhanced IVF as follows.
1. d - It represents the number of initial dimensions.
* For IVF , d = D.
* For IVF+ , d = 0.
... | 8,295 | 29.277372 | 116 | h |
covarep | covarep-master/misc/interp1ordered.c | /* Fast linear interpolation of ordered values (see the Matlab version for doc)
%
% Copyright (c) 2012 University of Crete - Computer Science Department (UOC-CSD)
%
% License
% This file is under the LGPL license, you can
% redistribute it and/or modify it under the terms of the GNU Lesser General
% Public License... | 2,215 | 27.050633 | 100 | c |
null | DIMES-main/TSP/TSP-KNN/MCTS_500_1000/code/TSP_IO.h | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <fstream>
#include <string.h>
#include <time.h>
#include <ctime>
#include <vector>
#include <string.h>
#include <math.h>
using namespace std;
#define Null -1
#define Inf_Cost 1000000000
#define Magnify_Rate ... | 13,209 | 22.054101 | 119 | h |
null | DIMES-main/TSP/TSP-KNN/MCTS_500_1000/code/TSP_Markov_Decision.h |
// Jump to a new state by randomly generating a solution
void Jump_To_Random_State()
{
Generate_Initial_Solution();
}
Distance_Type Markov_Decision_Process()
{
MCTS_Init(); // Initialize MCTS parameters
Generate_Initial_Solution(); // State initialization of MDP
Local_Search_by_2Opt_... | 952 | 27.029412 | 113 | h |
null | DIMES-main/TSP/TSP-KNN/MCTS_500_1000/code/TSP_2Opt.h |
// Evaluate the delta after applying a 2-opt move (delta >0 indicates an improving solution)
Distance_Type Get_2Opt_Delta(int First_City, int Second_City)
{
if(Check_If_Two_City_Same_Or_Adjacent(First_City, Second_City)==true)
return -Inf_Cost;
int First_Next_City=All_Node[First_City].Next_City;
int Second_Next... | 2,712 | 32.493827 | 104 | h |
null | DIMES-main/TSP/TSP-KNN/MCTS_10000/code/TSP_IO.h | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <fstream>
#include <string.h>
#include <time.h>
#include <ctime>
#include <vector>
#include <string.h>
#include <math.h>
using namespace std;
#define Null -1
#define Inf_Cost 1000000000
#define Magnify_Rate ... | 13,207 | 22.050611 | 119 | h |
null | DIMES-main/TSP/TSP-KNN/MCTS_10000/code/TSP_Markov_Decision.h |
// Jump to a new state by randomly generating a solution
void Jump_To_Random_State()
{
Generate_Initial_Solution();
}
Distance_Type Markov_Decision_Process()
{
MCTS_Init(); // Initialize MCTS parameters
Generate_Initial_Solution(); // State initialization of MDP
Local_Search_by_2Opt_... | 952 | 27.029412 | 113 | h |
null | DIMES-main/TSP/TSP-KNN/MCTS_10000/code/TSP_2Opt.h |
// Evaluate the delta after applying a 2-opt move (delta >0 indicates an improving solution)
Distance_Type Get_2Opt_Delta(int First_City, int Second_City)
{
if(Check_If_Two_City_Same_Or_Adjacent(First_City, Second_City)==true)
return -Inf_Cost;
int First_Next_City=All_Node[First_City].Next_City;
int Second_Next... | 2,712 | 32.493827 | 104 | h |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.