msanatan
/ namis_scraper.py
Last active
August 29, 2015 14:04
Scraper for wholesale fish market prices in Trinidad and Tobago
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| from lxml import html | |
| import requests | |
| import time | |
| date = time.strftime('%d-%m-%Y') | |
| output = '' | |
| try: | |
| page = requests.get('http://www.namistt.com/') | |
| except requests.exceptions.RequestException as e: |
msanatan
/ Cyclic.hs
Created
December 12, 2013 18:44
Simple way to check if a directed graph is cyclic in Haskell. Essentially it's a stripped down version of the Arthur B Kahn topological sorting algorithm. Uses the Functional Graph Library (http://hackage.haskell.org/package/fgl) for graph representation.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| module Cyclic | |
| (leafNode, | |
| hasLeaf, | |
| delLeaf, | |
| cyclic | |
| ) where | |
| import Data.Graph.Inductive | |
| {- Topological sorting involves removing nodes from the graph into a list to |
NewerOlder