niroyb

#!/Usr/bin/env python
# -*- coding: utf-8 -*-

'''
Searches a graph and yields all the minimum spanning trees in order of increasing cost.
This could be used to solve minimum spanning trees with constraints by yielding trees until
we reach the first one which satisfies a constraint.
For example it could solve the degree constrained minimum spanning tree DCMST
'''

niroyb

#pragma once

// @author Nicolas Roy @niroyb
// @date 2013-04-22
// Disjoint set data structure aka unionfind
// Time complexity of log(n) for all operations because of map.find()

#include <map>

template<class verticeType>

niroyb

'''Groupe les notes et permet de trouver les seuils'''

import re
from collections import defaultdict

with open('Resultat.txt') as f:
    text = f.read()

matches = re.findall('((?:[A-F])(?:\*|\+|\s))\s*\|\s*([0-9.]+)', text)
print len(matches), 'notes :'

niroyb

Code Climate

TravisCi

Coveralls